Valentine Kabanets
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
23
Venues
9
Active years
1997–2026
Best venue rank
A*
Where they publish
Papers
23 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Kolmogorov's Approach to P vs. NP: Chain Rules for Time-Bounded Kolmogorov Complexity. | Valentine Kabanets, Antonina Kolokolova |
| 2021 | FOCS | LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. | Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira |
| 2021 | ICALP | Lifting for Constant-Depth Circuits and Applications to MCSP. | Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
| 2019 | ICALP | Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. | Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis |
| 2019 | ICALP | AC | Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal |
| 2017 | MFCS | Does Looking Inside a Circuit Help?. | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani |
| 2017 | STOC | A polynomial restriction lemma with applications. | Valentine Kabanets, Daniel M. Kane, Zhenjian Lu |
| 2016 | TCC | Simultaneous Secrecy and Reliability Amplification for a General Channel Model. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro |
| 2015 | COCOON | Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. | Ruiwen Chen, Valentine Kabanets |
| 2015 | STACS | The Minimum Oracle Circuit Size Problem. | Eric Allender, Dhiraj Holden, Valentine Kabanets |
| 2014 | MFCS | An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas. | Ruiwen Chen, Valentine Kabanets, Nitin Saurabh |
| 2012 | COCOON | Lower Bounds against Weakly Uniform Circuits. | Ruiwen Chen, Valentine Kabanets |
| 2009 | STOC | An axiomatic approach to algebrization. | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
| 2009 | STOC | New direct-product testers and 2-query PCPs. | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
| 2009 | TCC | Security Amplification for InteractiveCryptographic Primitives. | Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
| 2008 | STOC | Uniform direct product theorems: simplified, optimized, and derandomized. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson |
| 2007 | CRYPTO | Chernoff-Type Direct Product Theorems. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
| 2006 | FOCS | Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
| 2006 | LATIN | Hardness Amplification Via Space-Efficient Direct Products. | Venkatesan Guruswami, Valentine Kabanets |
| 2003 | STOC | Derandomizing polynomial identity tests means proving circuit lower bounds. | Valentine Kabanets, Russell Impagliazzo |
| 2000 | LATIN | Almost | Valentine Kabanets |
| 2000 | STOC | Circuit minimization problem. | Valentine Kabanets, Jin-yi Cai |
| 1997 | ICALP | Recognizability Equals Definability for Partial k-Paths. | Valentine Kabanets |