Antonina Kolokolova

According to our database¹, Antonina Kolokolova authored at least 38 papers between 2001 and 2023.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Limits of CDCL Learning via Merge Resolution.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

2022

Banksformer: A Deep Generative Model for Synthetic Transaction Sequences.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

Creating Diverse Ensembles for Classification with Genetic Programming and Neuro-MAP-Elites.

[BibT_eX]

[DOI]

Kyle L. Nickerson

Antonina Kolokolova

Ting Hu

Proceedings of the Genetic Programming - 25th European Conference, 2022

Learning with Distributional Inverters.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021

LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Learning with distributional inverters.

[BibT_eX]

[DOI]

CoRR, 2021

On the Hierarchical Community Structure of Practical SAT Formulas.

[BibT_eX]

[DOI]

CoRR, 2021

On the Hierarchical Community Structure of Practical Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Lifting for Constant-Depth Circuits and Applications to MCSP.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

GANs & Reels: Creating Irish Music using a Generative Adversarial Network.

[BibT_eX]

[DOI]

CoRR, 2020

2019

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

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

AC<sup>0</sup>[p] Lower Bounds Against MCSP via the Coin Problem.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Compression Improves Image Classification Accuracy.

[BibT_eX]

[DOI]

Nnamdi Ozah

Antonina Kolokolova

Proceedings of the Advances in Artificial Intelligence, 2019

2018

The Proof Complexity of SMT Solvers.

[BibT_eX]

[DOI]

Robert Robere

Antonina Kolokolova

Vijay Ganesh

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

2017

Does Looking Inside a Circuit Help?

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Stabbing Planes.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Expander Construction in VNC1.

[BibT_eX]

[DOI]

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

Agnostic Learning from Tolerant Natural Proofs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2017

Complexity Barriers as Independence.

[BibT_eX]

[DOI]

Antonina Kolokolova

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

2016

Algorithms from Natural Lower Bounds.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Expander Construction in VNC<sup>1</sup>.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Learning Algorithms from Natural Proofs.

[BibT_eX]

[DOI]

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Complexity of alignment and decoding problems: restrictions and approximations.

[BibT_eX]

[DOI]

Noah Fleming

Antonina Kolokolova

Renesa Nizamee

Mach. Transl., 2015

Mining Circuit Lower Bound Proofs for Meta-Algorithms.

[BibT_eX]

[DOI]

Comput. Complex., 2015

Tighter Connections between Derandomization and Circuit Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2015

2014

Approximating solution structure of the Weighted Sentence Alignment problem.

[BibT_eX]

[DOI]

Antonina Kolokolova

Renesa Nizamee

CoRR, 2014

2013

Compression of Boolean Functions.

[BibT_eX]

[DOI]

Valentine Kabanets

Antonina Kolokolova

Electron. Colloquium Comput. Complex., 2013

2012

Expressing versus Proving: Relating Forms of Complexity in Logic.

[BibT_eX]

[DOI]

Antonina Kolokolova

J. Log. Comput., 2012

2010

On the Complexity of Model Expansion.

[BibT_eX]

[DOI]

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

2009

An Axiomatic Approach to Algebrization.

[BibT_eX]

[DOI]

Russell Impagliazzo

Valentine Kabanets

Antonina Kolokolova

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

2008

Many Facets of Complexity in Logic.

[BibT_eX]

[DOI]

Antonina Kolokolova

Proceedings of the Logic and Theory of Algorithms, 2008

2005

Systems of bounded arithmetic from descriptive complexity.

[BibT_eX]

[DOI]

Antonina Kolokolova

PhD thesis, 2005

Closure Properties of Weak Systems of Bounded Arithmetic.

[BibT_eX]

[DOI]

Antonina Kolokolova

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

2004

A Second-Order Theory for NL.

[BibT_eX]

[DOI]

Stephen A. Cook

Antonina Kolokolova

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.

[BibT_eX]

[DOI]

Stephen A. Cook

Antonina Kolokolova

Ann. Pure Appl. Log., 2003

2001

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

[BibT_eX]

[DOI]

Stephen A. Cook

Antonina Kolokolova

Electron. Colloquium Comput. Complex., 2001

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

[BibT_eX]

[DOI]

Stephen A. Cook

Antonina Kolokolova

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

Antonina Kolokolova

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...