# Antonina Kolokolova

According to our database

Collaborative distances:

^{1}, Antonina Kolokolova authored at least 25 papers between 2001 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Stabbing Planes.

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

The Proof Complexity of SMT Solvers.

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017

Does Looking Inside a Circuit Help?

Electronic Colloquium on Computational Complexity (ECCC), 2017

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

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Does Looking Inside a Circuit Help?.

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Expander Construction in VNC1.

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Agnostic Learning from Tolerant Natural Proofs.

Proceedings of the Approximation, 2017

Complexity Barriers as Independence.

Proceedings of the Incomputable: Journeys Beyond the Turing Barrier, 2017

2016

Algorithms from Natural Lower Bounds.

Electronic Colloquium on Computational Complexity (ECCC), 2016

Expander Construction in VNC

^{1}.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Learning Algorithms from Natural Proofs.

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Complexity of alignment and decoding problems: restrictions and approximations.

Machine Translation, 2015

Tighter Connections between Derandomization and Circuit Lower Bounds.

Proceedings of the Approximation, 2015

2014

Mining Circuit Lower Bound Proofs for Meta-algorithms.

Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013

Compression of Boolean Functions.

Electronic Colloquium on Computational Complexity (ECCC), 2013

2012

Expressing versus Proving: Relating Forms of Complexity in Logic.

J. Log. Comput., 2012

2010

On the Complexity of Model Expansion.

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

An axiomatic approach to algebrization.

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

An Axiomatic Approach to Algebrization.

Proceedings of the Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009

2008

Many Facets of Complexity in Logic.

Proceedings of the Logic and Theory of Algorithms, 2008

2005

Closure Properties of Weak Systems of Bounded Arithmetic.

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004

A Second-Order Theory for NL.

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

A second-order system for polytime reasoning based on Grädel's theorem.

Ann. Pure Appl. Logic, 2003

2001

A second-order system for polynomial-time reasoning based on Graedel's theorem

Electronic Colloquium on Computational Complexity (ECCC), 2001

A Second-Order System for Polytime Reasoning Using Graedel's Theorem.

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001