Antonina Kolokolova
ScholarGPS® ID: 25013782684691
Affiliation History
Discipline
Computer Science
Top Specialties
Logic | Artificial Intelligence | Combinatorial Optimization
Metrics Summary
Publication Count
26
Predicted Citations
250
Predicted h-index
10
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
Add
Delete
|
---|
Personalized Classifier Selection for EEG-Based BCIs (journal article) Computers, volume 13, issue 7, pages 158- (2024). |
Banksformer: A Deep Generative Model for Synthetic Transaction Sequences (book chapter) In Machine Learning and Knowledge Discovery in Databases Springer Nature Switzerland (2023) |
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (2022) Denver, CO, USA |
Creating Diverse Ensembles for Classification with Genetic Programming and Neuro-MAP-Elites (book chapter) In Genetic Programming Springer International Publishing (2022) |
On the Hierarchical Community Structure of Practical Boolean Formulas (book chapter) In Theory and Applications of Satisfiability Testing – SAT 2021 Springer International Publishing (2021) |
Expander construction in VNC1 (journal article) Annals of Pure and Applied Logic, volume 171, issue 7, pages 102796- (2020). |
Completeness for First-order Properties on Sparse Structures with Algorithmic Applications (journal article) ACM Transactions on Algorithms, volume 15, issue 2, pages 1-35 (2019). |
Compression Improves Image Classification Accuracy (book chapter) In Advances in Artificial Intelligence Springer International Publishing (2019) |
The Proof Complexity of SMT Solvers (book chapter) In Computer Aided Verification Springer International Publishing (2018) |
Expander Construction in VNC1 (conference) Conference on Innovations in Theoretical Computer Science (2017) |
Does Looking Inside a Circuit Help (conference) Mathematical Foundations of Computer Science (2017) |
Agnostic Learning from Tolerant Natural Proofs. (conference) International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2017) |
Complexity Barriers as Independence (book chapter) In The Incomputable Springer International Publishing (2017) |
Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications (conference) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (2017) |
Learning algorithms from natural proofs (conference) Conference on Computational Complexity (2016) |
Machine Translation, volume 29, issue 3-4, pages 163-187 (2015). |
Mining Circuit Lower Bound Proofs for Meta-Algorithms (journal article) computational complexity, volume 24, issue 2, pages 333-392 (2015). |
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2015) |
2014 IEEE Conference on Computational Complexity (CCC) (2014) Vancouver, BC, Canada |
Expressing versus Proving: Relating Forms of Complexity in Logic (journal article) Journal of Logic and Computation, volume 22, issue 2, pages 267-280 (2012). |