Home page of Antonina Kolokolova

Antonina Kolokolova

I am interested in computational logic and complexity theory, especially in its connection to bounded arithmetic and finite model theory. My Ph.D. is from the Dept. of Computer Science at the University of Toronto supervised by Stephen Cook. I defended my thesis in October 2004.

Since the summer 2007, I am at the Computer Science department of the Memorial University of Newfoundland. Before that, I was a PIMS postdoc at Dept. of Computer Science at the Simon Fraser University. I had an intermediate affiliation at the Mathematical Institute of the Academy of Sciences of the Czech Republic.

Here are my CV, research statements for CS and math ,teaching statements for CS and math, and a list of references .

The Theory Student Seminar is now organized by Mark Braverman.

The Resolution Song is now online.

Publications

Complexity of expanding a finite structure and related tasks LCC'06
"Closure properties of weak systems of bounded arithmetic", CSL'05, LNCS 3634, pp. 369-383.
My PhD thesis (errata)
"A second-order theory for NL" with Stephen Cook, LICS 2004, pp. 398-407
"A second-order system for polytime reasoning based on Gradel's theorem" with Stephen Cook, APAL 124: 193-231, 2003
A conference version of the APAL 2003 paper, LICS 2001
My Masters thesis

Antonina Kolokolova

Publications

Teaching

Other links