Antonina Kolokolova

According to our database, Antonina Kolokolova authored at least 41 papers between 2001 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Chain Rules for Time-Bounded Kolmogorov Complexity.

Valentine Kabanets, Antonina Kolokolova

Electron. Colloquium Comput. Complex., 2025

Provability of the Circuit Size Hierarchy and Its Consequences.

Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira, Dimitrios Tsintsilidas

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

Personalized Classifier Selection for EEG-Based BCIs.

Javad Rahimipour Anaraki, Antonina Kolokolova, Tom Chau

Comput., July, 2024

2023

Limits of CDCL Learning via Merge Resolution.

Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

2022

Banksformer: A Deep Generative Model for Synthetic Transaction Sequences.

Kyle L. Nickerson, Terrence S. Tricco, Antonina Kolokolova, Farzaneh Shoeleh, Charles Robertson, John Hawkin, Ting Hu

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

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

Kyle L. Nickerson, Antonina Kolokolova, Ting Hu

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

Learning with Distributional Inverters.

Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, R. Ramyaa, Manuel Sabin

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

2021

Learning with distributional inverters.

Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, Ramyaa Ramyaa, Manuel Sabin

CoRR, 2021

On the Hierarchical Community Structure of Practical SAT Formulas.

Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh

CoRR, 2021

On the Hierarchical Community Structure of Practical Boolean Formulas.

Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh

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

Lifting for Constant-Depth Circuits and Applications to MCSP.

Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova

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

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

Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

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

Antonina Kolokolova, Mitchell Billard, Robert Bishop, Moustafa Elsisy, Zachary Northcott, Laura Graves, Vineel Nagisetty, Heather Patey

CoRR, 2020

2019

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

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

Electron. Colloquium Comput. Complex., 2019

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

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

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

Compression Improves Image Classification Accuracy.

Nnamdi Ozah, Antonina Kolokolova

Proceedings of the Advances in Artificial Intelligence, 2019

2018

Stabbing Planes.

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

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

The Proof Complexity of SMT Solvers.

Robert Robere, Antonina Kolokolova, Vijay Ganesh

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

2017

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

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

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

Does Looking Inside a Circuit Help?.

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

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

Expander Construction in VNC1.

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

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

Agnostic Learning from Tolerant Natural Proofs.

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

Proceedings of the Approximation, 2017

Complexity Barriers as Independence.

Antonina Kolokolova

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

2016

Algorithms from Natural Lower Bounds.

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

Electron. Colloquium Comput. Complex., 2016

Expander Construction in VNC¹.

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

Electron. Colloquium Comput. Complex., 2016

Learning Algorithms from Natural Proofs.

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

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Complexity of alignment and decoding problems: restrictions and approximations.

Noah Fleming, Antonina Kolokolova, Renesa Nizamee

Mach. Transl., 2015

Tighter Connections between Derandomization and Circuit Lower Bounds.

Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova

Proceedings of the Approximation, 2015

2014

Approximating solution structure of the Weighted Sentence Alignment problem.

Antonina Kolokolova, Renesa Nizamee

CoRR, 2014

Mining Circuit Lower Bound Proofs for Meta-algorithms.

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

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

2013

Compression of Boolean Functions.

Valentine Kabanets, Antonina Kolokolova

Electron. Colloquium Comput. Complex., 2013

2012

Expressing versus Proving: Relating Forms of Complexity in Logic.

Antonina Kolokolova

J. Log. Comput., 2012

2010

On the Complexity of Model Expansion.

Antonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska

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

2009

An Axiomatic Approach to Algebrization.

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.

Antonina Kolokolova

Proceedings of the Logic and Theory of Algorithms, 2008

2005

Systems of bounded arithmetic from descriptive complexity.

Antonina Kolokolova

PhD thesis, 2005

Closure Properties of Weak Systems of Bounded Arithmetic.

Antonina Kolokolova

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

2004

A Second-Order Theory for NL.

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.

Stephen A. Cook, Antonina Kolokolova

Ann. Pure Appl. Log., 2003

2001

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

Stephen A. Cook, Antonina Kolokolova

Electron. Colloquium Comput. Complex., 2001

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

Stephen A. Cook, Antonina Kolokolova

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