Home Research-feed Channel Rankings GCT THU AI TR Open Data Must Reading

views: 39

Antonina Kolokolova

I am now a PIMS postdoc at Dept. of Computer Science at the Simon Fraser University. Until recently, I was a Ph.D. student in the Dept. of Computer Science at the University of Toronto supervised by Stephen Cook. I defended my thesis in October 2004. I had an intermediate affiliation at the Mathematical Institute of the Academy of Sciences of the Czech Republic

Memorial University of Newfoundland, Canada

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers34 papers

Sort

By YearBy Citation

Expander construction in VNC1

Sam Buss,Valentine Kabanets,Antonina Kolokolova,Michal Koucký

Annals of Pure and Applied Logic, no. 7 (2020): 102796

Cited by3EIBibtex

AC 0 [p] Lower Bounds Against MCSP via the Coin Problem

Alexander Golovnev, Rahul Ilango,Russell Impagliazzo,Valentine Kabanets,Antonina Kolokolova,Avishay Tal

international colloquium on automata, languages and programming, (2019)

Cited by11Bibtex

Completeness for First-order Properties on Sparse Structures with Algorithmic Applications

Jiawei Gao,Russell Impagliazzo,Antonina Kolokolova,Ryan Williams

ACM TRANSACTIONS ON ALGORITHMS, no. SP2 (2019)

Bibtex

Compression Improves Image Classification Accuracy

Nnamdi Ozah,Antonina Kolokolova

ADVANCES IN ARTIFICIAL INTELLIGENCE, (2019): 525-530

EIBibtex

AC0[p] Lower Bounds against MCSP via the Coin Problem

Alexander Golovnev, Rahul Ilango,Russell Impagliazzo,Valentine Kabanets,Antonina Kolokolova,Avishay Tal

Electronic Colloquium on Computational Complexity (ECCC), (2019): 18

EIBibtex

The Proof Complexity of SMT Solvers

Robert Robere,Antonina Kolokolova,Vijay Ganesh

CAV, pp.275-293, (2018)

Cited by3EIBibtex

Stabbing Planes

Paul Beame, Noah Fleming,Russell Impagliazzo,Antonina Kolokolova,Denis Pankratov,Toniann Pitassi, Robert Robere

ITCS, pp.10:1-10:20, (2018)

Cited by6EIBibtex

Completeness for first-order properties on sparse structures with algorithmic applications

Jiawei Gao,Russell Impagliazzo,Antonina Kolokolova,Ryan Williams

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp.2162-2181, (2017)

Cited by37EIBibtex

Agnostic Learning from Tolerant Natural Proofs

Marco L. Carmosino,Russell Impagliazzo,Valentine Kabanets,Antonina Kolokolova

APPROX-RANDOM, pp.35:1-35:19, (2017)

Cited by1EIBibtex

Does Looking Inside a Circuit Help

Russell Impagliazzo,Valentine Kabanets,Antonina Kolokolova,Pierre McKenzie, Shadab Romani

Electronic Colloquium on Computational Complexity (ECCC), (2017)

EIBibtex

Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications

Jiawei Gao,Russell Impagliazzo,Antonina Kolokolova,R. Ryan Williams

SODA, pp.2162-2181, (2017)

Cited by37EIBibtex

Expander Construction in VNC1

Sam Buss,Valentine Kabanets,Antonina Kolokolova,Michal Koucky

ITCS, pp.31:1-31:26, (2017)

Cited by3EIBibtex

Expander Construction in VNC 1

Samuel R. Buss,Valentine Kabanets,Antonina Kolokolova, Michal Koucky

Electronic Colloquium on Computational Complexity, (2016): 144

Bibtex

Learning Algorithms from Natural Proofs

Marco L. Carmosino,Russell Impagliazzo,Valentine Kabanets,Antonina Kolokolova

Leibniz International Proceedings in Informatics, (2016): 10:1-10:24

Cited by44EIBibtex

Algorithms from Natural Lower Bounds

Marco L. Carmosino,Russell Impagliazzo,Valentine Kabanets,Antonina Kolokolova

Electronic Colloquium on Computational Complexity (ECCC), (2016)

Cited by3EIBibtex

Tighter Connections between Derandomization and Circuit Lower Bounds

Marco Carmosino,Russell Impagliazzo,Valentine Kabanets,Antonina Kolokolova

APPROX-RANDOM, pp.645-658, (2015)

Cited by8EIBibtex

Mining Circuit Lower Bound Proofs for Meta-Algorithms

Ruiwen Chen,Valentine Kabanets,Antonina Kolokolova,Ronen Shaltiel,David Zuckerman

IEEE Conference on Computational Complexity, no. 2 (2015): 333-392

Cited by61EIWOSBibtex

Complexity of alignment and decoding problems: restrictions and approximations

Noah Fleming,Antonina Kolokolova,Renesa Nizamee

Machine Translation, no. 3-4 (2015): 163-187

EIBibtex

Glider mission planning using generic solvers

Tamkin Khan Avi,Antonina Kolokolova, Adam Murphy, Richard Bajona, Kenneth Collingwood, Melissa Reid

(2014)

Bibtex

Compression of Boolean Functions

Valentine Kabanets,Antonina Kolokolova

Electronic Colloquium on Computational Complexity (ECCC), (2013): 24

Cited by2EIBibtex

View All

Base Info Papers Patents Projects