Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Valentine
    Last name: Kabanets
    DBLP: k/ValentineKabanets
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 78  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich.
    The Power of Natural Properties as Oracles.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Journal article
    Russell Impagliazzo, Valentine Kabanets.
    Fourier Concentration from Shrinkage.
    Computational Complexity 2017, Volume 26 (0) 2017
    Conference paper
    Eric Allender, Dhiraj Holden, Valentine Kabanets.
    The Minimum Oracle Circuit Size Problem.
    Computational Complexity 2017, Volume 26 (0) 2017
    Conference paper
    Valentine Kabanets, Daniel M. Kane, Zhenjian Lu.
    A Polynomial Restriction Lemma with Applications.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Valentine Kabanets, Daniel M. Kane, Zhenjian Lu.
    A polynomial restriction lemma with applications.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova.
    Algorithms from Natural Lower Bounds.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel.
    Pseudorandomness when the odds are against you.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel.
    Pseudorandomness When the Odds are Against You.
    31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan 2016 (0) 2016
    Conference paper
    Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova.
    Learning Algorithms from Natural Proofs.
    31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan 2016 (0) 2016
    Journal article
    Ruiwen Chen, Valentine Kabanets, Nitin Saurabh.
    An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas.
    Algorithmica 2016, Volume 76 (0) 2016
    Conference paper
    Samuel R. Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký.
    Expander Construction in VNC
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro.
    Simultaneous Secrecy and Reliability Amplification for a General Channel Model.
    IACR Cryptology ePrint Archive 2016, Volume 2016 (0) 2016
    Conference paper
    Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro.
    Simultaneous Secrecy and Reliability Amplification for a General Channel Model.
    Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I 2016 (0) 2016
    Conference paper
    Ruiwen Chen, Valentine Kabanets.
    Correlation bounds and #SAT algorithms for small linear-size circuits.
    Theor. Comput. Sci. 2016, Volume 654 (0) 2016
    Conference paper
    Valentine Kabanets, Thomas Thierauf, Jacobo Torán, Christopher Umans.
    Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411).
    Dagstuhl Reports 2016, Volume 6 (0) 2016
    Conference paper
    Eric Allender, Dhiraj Holden, Valentine Kabanets.
    The Minimum Oracle Circuit Size Problem.
    32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany 2015 (0) 2015
    Conference paper
    Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman.
    Mining Circuit Lower Bound Proofs for Meta-Algorithms.
    Computational Complexity 2015, Volume 24 (0) 2015
    Conference paper
    Ruiwen Chen, Valentine Kabanets.
    Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits.
    Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings 2015 (0) 2015
    Conference paper
    Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova.
    Tighter Connections between Derandomization and Circuit Lower Bounds.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA 2015 (0) 2015
    Journal article
    Ruiwen Chen, Valentine Kabanets, Jeff Kinne.
    Lower Bounds Against Weakly-Uniform Threshold Circuits.
    Algorithmica 2014, Volume 70 (0) 2014
    Conference paper
    Ruiwen Chen, Valentine Kabanets, Nitin Saurabh.
    An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas.
    Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II 2014 (0) 2014
    Conference paper
    Russell Impagliazzo, Valentine Kabanets.
    Fourier Concentration from Shrinkage.
    IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014 2014 (0) 2014
    Conference paper
    Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman.
    Mining Circuit Lower Bound Proofs for Meta-algorithms.
    IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014 2014 (0) 2014
    Conference paper
    Ruiwen Chen, Valentine Kabanets.
    Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits.
    Electronic Colloquium on Computational Complexity (ECCC) 2014, Volume 21 (0) 2014
    Conference paper
    Eric Allender, Dhiraj Holden, Valentine Kabanets.
    The Minimum Oracle Circuit Size Problem.
    Electronic Colloquium on Computational Complexity (ECCC) 2014, Volume 21 (0) 2014
    Show item 1 to 25 of 78  

    Your query returned 78 matches in the database.