Mining circuit lower bound proofs for meta-algorithms R Chen, V Kabanets, A Kolokolova, R Shaltiel, D Zuckerman Computational Complexity 24 (2), 333-392, 2015 | 60 | 2015 |

Learning algorithms from natural proofs ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova 31st Conference on Computational Complexity (CCC 2016), 2016 | 44 | 2016 |

A second-order system for polytime reasoning based on Grädel's theorem S Cook, A Kolokolova Annals of Pure and Applied Logic 124 (1-3), 193-231, 2003 | 40 | 2003 |

Completeness for first-order properties on sparse structures with algorithmic applications J Gao, R Impagliazzo, A Kolokolova, R Williams ACM Transactions on Algorithms (TALG) 15 (2), 1-35, 2018 | 37 | 2018 |

Systems of bounded arithmetic from descriptive complexity. A Kolokolova | 23 | 2005 |

An axiomatic approach to algebrization R Impagliazzo, V Kabanets, A Kolokolova Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 22 | 2009 |

On the complexity of model expansion A Kolokolova, Y Liu, D Mitchell, E Ternovska International Conference on Logic for Programming Artificial Intelligence …, 2010 | 17 | 2010 |

Tighter connections between derandomization and circuit lower bounds ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015 | 13 | 2015 |

A second-order theory for NL S Cook, A Kolokolova Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 12 | 2004 |

AC^ 0 [p] Lower Bounds Against MCSP via the Coin Problem A Golovnev, R Ilango, R Impagliazzo, V Kabanets, A Kolokolova, A Tal 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 11 | 2019 |

Closure properties of weak systems of bounded arithmetic A Kolokolova International Workshop on Computer Science Logic, 369-383, 2005 | 8 | 2005 |

Stabbing planes P Beame, N Fleming, R Impagliazzo, A Kolokolova, D Pankratov, T Pitassi, ... arXiv preprint arXiv:1710.03219, 2017 | 5 | 2017 |

Agnostic learning from tolerant natural proofs ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 4 | 2017 |

Compression of Boolean Functions. V Kabanets, A Kolokolova Electronic Colloquium on Computational Complexity (ECCC) 20, 24, 2013 | 4 | 2013 |

Complexity of expanding a finite structure and related tasks A Kolokolova, Y Liu, D Mitchell, E Ternovska Logic and Computational Complexity, workshop associated with LICS 6, 2006 | 4 | 2006 |

Expander construction in VNC1 S Buss, V Kabanets, A Kolokolova, M Koucký Annals of Pure and Applied Logic, 102796, 2020 | 3 | 2020 |

The proof complexity of SMT solvers R Robere, A Kolokolova, V Ganesh International Conference on Computer Aided Verification, 275-293, 2018 | 3 | 2018 |

Algorithms from Natural Lower Bounds. ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova Electronic Colloquium on Computational Complexity (ECCC) 23, 8, 2016 | 3 | 2016 |

Compression improves image classification accuracy N Ozah, A Kolokolova Canadian Conference on Artificial Intelligence, 525-530, 2019 | 1 | 2019 |

Glider mission planning using generic solvers TK Avi Memorial University of Newfoundland, 2014 | 1 | 2014 |