default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonina Kolokolova
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Javad Rahimipour Anaraki
, Antonina Kolokolova, Tom Chau:
Personalized Classifier Selection for EEG-Based BCIs. Comput. 13(7): 158 (2024)- [i18]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira, Dimitrios Tsintsilidas:
Provability of the Circuit Size Hierarchy and Its Consequences. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c24]Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh:
Limits of CDCL Learning via Merge Resolution. SAT 2023: 27:1-27:19 - [i17]Marc Vinyals, Chunxiao (Ian) Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh:
Limits of CDCL Learning via Merge Resolution. CoRR abs/2304.09422 (2023) - [i16]Noah Fleming, Vijay Ganesh, Antonina Kolokolova, Chunxiao Li, Marc Vinyals:
Limits of CDCL Learning via Merge Resolution. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c23]Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, R. Ramyaa, Manuel Sabin:
Learning with Distributional Inverters. ALT 2022: 90-106 - [c22]Kyle L. Nickerson, Antonina Kolokolova, Ting Hu:
Creating Diverse Ensembles for Classification with Genetic Programming and Neuro-MAP-Elites. EuroGP 2022: 212-227 - [c21]Kyle L. Nickerson, Terrence S. Tricco, Antonina Kolokolova, Farzaneh Shoeleh, Charles Robertson, John Hawkin, Ting Hu:
Banksformer: A Deep Generative Model for Synthetic Transaction Sequences. ECML/PKDD (6) 2022: 121-136 - 2021
- [c20]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira:
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. FOCS 2021: 770-780 - [c19]Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Lifting for Constant-Depth Circuits and Applications to MCSP. ICALP 2021: 44:1-44:20 - [c18]Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh:
On the Hierarchical Community Structure of Practical Boolean Formulas. SAT 2021: 359-376 - [i15]Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh:
On the Hierarchical Community Structure of Practical SAT Formulas. CoRR abs/2103.14992 (2021) - [i14]Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, Ramyaa Ramyaa, Manuel Sabin:
Learning with distributional inverters. CoRR abs/2112.12340 (2021) - [i13]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira:
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j6]Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký:
Expander construction in VNC1. Ann. Pure Appl. Log. 171(7): 102796 (2020) - [i12]Antonina Kolokolova, Mitchell Billard, Robert Bishop, Moustafa Elsisy, Zachary Northcott, Laura Graves, Vineel Nagisetty, Heather Patey:
GANs & Reels: Creating Irish Music using a Generative Adversarial Network. CoRR abs/2010.15772 (2020)
2010 – 2019
- 2019
- [j5]Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, Ryan Williams:
Completeness for First-order Properties on Sparse Structures with Algorithmic Applications. ACM Trans. Algorithms 15(2): 23:1-23:35 (2019) - [c17]Nnamdi Ozah, Antonina Kolokolova:
Compression Improves Image Classification Accuracy. Canadian AI 2019: 525-530 - [c16]Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal:
AC0[p] Lower Bounds Against MCSP via the Coin Problem. ICALP 2019: 66:1-66:15 - [i11]Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal:
AC0[p] Lower Bounds against MCSP via the Coin Problem. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c15]Robert Robere, Antonina Kolokolova, Vijay Ganesh:
The Proof Complexity of SMT Solvers. CAV (2) 2018: 275-293 - [c14]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. ITCS 2018: 10:1-10:20 - 2017
- [c13]Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Agnostic Learning from Tolerant Natural Proofs. APPROX-RANDOM 2017: 35:1-35:19 - [c12]Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký:
Expander Construction in VNC1. ITCS 2017: 31:1-31:26 - [c11]Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani:
Does Looking Inside a Circuit Help?. MFCS 2017: 1:1-1:13 - [c10]Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, R. Ryan Williams:
Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications. SODA 2017: 2162-2181 - [p1]Antonina Kolokolova:
Complexity Barriers as Independence. The Incomputable 2017: 143-168 - [e1]Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings. Lecture Notes in Computer Science 10389, Springer 2017, ISBN 978-3-319-62126-5 [contents] - [i10]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. CoRR abs/1710.03219 (2017) - [i9]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. Electron. Colloquium Comput. Complex. TR17 (2017) - [i8]Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani:
Does Looking Inside a Circuit Help? Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c9]Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Learning Algorithms from Natural Proofs. CCC 2016: 10:1-10:24 - [i7]Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký:
Expander Construction in VNC1. Electron. Colloquium Comput. Complex. TR16 (2016) - [i6]Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Algorithms from Natural Lower Bounds. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j4]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Comput. Complex. 24(2): 333-392 (2015) - [j3]Noah Fleming, Antonina Kolokolova, Renesa Nizamee:
Complexity of alignment and decoding problems: restrictions and approximations. Mach. Transl. 29(3-4): 163-187 (2015) - [c8]Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Tighter Connections between Derandomization and Circuit Lower Bounds. APPROX-RANDOM 2015: 645-658 - 2014
- [c7]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-algorithms. CCC 2014: 262-273 - [i5]Antonina Kolokolova, Renesa Nizamee:
Approximating solution structure of the Weighted Sentence Alignment problem. CoRR abs/1409.2433 (2014) - 2013
- [i4]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Electron. Colloquium Comput. Complex. TR13 (2013) - [i3]Valentine Kabanets, Antonina Kolokolova:
Compression of Boolean Functions. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j2]Antonina Kolokolova:
Expressing versus Proving: Relating Forms of Complexity in Logic. J. Log. Comput. 22(2): 267-280 (2012) - 2010
- [c6]Antonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska:
On the Complexity of Model Expansion. LPAR (Yogyakarta) 2010: 447-458
2000 – 2009
- 2009
- [c5]Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
An axiomatic approach to algebrization. STOC 2009: 695-704 - [i2]Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
An Axiomatic Approach to Algebrization. Algebraic Methods in Computational Complexity 2009 - 2008
- [c4]Antonina Kolokolova:
Many Facets of Complexity in Logic. CiE 2008: 316-325 - 2005
- [b1]Antonina Kolokolova:
Systems of bounded arithmetic from descriptive complexity. University of Toronto, Canada, 2005 - [c3]Antonina Kolokolova:
Closure Properties of Weak Systems of Bounded Arithmetic. CSL 2005: 369-383 - 2004
- [c2]Stephen A. Cook, Antonina Kolokolova:
A Second-Order Theory for NL. LICS 2004: 398-407 - 2003
- [j1]Stephen A. Cook, Antonina Kolokolova:
A second-order system for polytime reasoning based on Grädel's theorem. Ann. Pure Appl. Log. 124(1-3): 193-231 (2003) - 2001
- [c1]Stephen A. Cook, Antonina Kolokolova:
A Second-Order System for Polytime Reasoning Using Graedel's Theorem. LICS 2001: 177-186 - [i1]Stephen A. Cook, Antonina Kolokolova:
A second-order system for polynomial-time reasoning based on Graedel's theorem. Electron. Colloquium Comput. Complex. TR01 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
