- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j15 |      | Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe: Is Valiant-Vazirani's isolation probability improvable? Computational Complexity 22(2): 345-383 (2013) |
| i16 | | Valentine Kabanets, Antonina Kolokolova: Compression of Boolean Functions. Electronic Colloquium on Computational Complexity (ECCC) 20: 24 (2013) |
| i15 | | Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman: Mining Circuit Lower Bound Proofs for Meta-Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 20: 57 (2013) |
| 2012 | ||
| j14 | | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson: New Direct-Product Testers and 2-Query PCPs. SIAM J. Comput. 41(6): 1722-1768 (2012) |
| c18 | | Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe: Is Valiant-Vazirani's Isolation Probability Improvable? IEEE Conference on Computational Complexity 2012: 10-20 |
| c17 | | |
| i14 | | Ruiwen Chen, Valentine Kabanets: Lower Bounds against Weakly Uniform Circuits. Electronic Colloquium on Computational Complexity (ECCC) 19: 7 (2012) |
| 2011 | ||
| i13 | | Valentine Kabanets, Osamu Watanabe: Is the Valiant-Vazirani Isolation Lemma Improvable? Electronic Colloquium on Computational Complexity (ECCC) 18: 151 (2011) |
| 2010 | ||
| j13 | | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson: Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J. Comput. 39(4): 1637-1665 (2010) |
| c16 | | Russell Impagliazzo, Valentine Kabanets: Constructive Proofs of Concentration Bounds. APPROX-RANDOM 2010: 617-631 |
| i12 | | Russell Impagliazzo, Valentine Kabanets: Constructive Proofs of Concentration Bounds. Electronic Colloquium on Computational Complexity (ECCC) 17: 72 (2010) |
| 2009 | ||
| j12 | | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka: The Black-Box Query Complexity of Polynomial Summation. Computational Complexity 18(1): 59-79 (2009) |
| j11 | | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Chernoff-Type Direct Product Theorems. J. Cryptology 22(1): 75-92 (2009) |
| j10 | | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification. SIAM J. Comput. 39(2): 564-605 (2009) |
| c15 | | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson: New direct-product testers and 2-query PCPs. STOC 2009: 131-140 |
| c14 | | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova: An axiomatic approach to algebrization. STOC 2009: 695-704 |
| c13 | | Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Security Amplification for InteractiveCryptographic Primitives. TCC 2009: 128-145 |
| i11 | | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson: New Direct-Product Testers and 2-Query PCPs. Electronic Colloquium on Computational Complexity (ECCC) 16: 90 (2009) |
| 2008 | ||
| j9 | | Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans: On the Complexity of Succinct Zero-Sum Games. Computational Complexity 17(3): 353-376 (2008) |
| j8 | | Venkatesan Guruswami, Valentine Kabanets: Hardness Amplification via Space-Efficient Direct Products. Computational Complexity 17(4): 475-500 (2008) |
| j7 | | Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi: The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. J. Comput. Syst. Sci. 74(3): 386-393 (2008) |
| c12 | | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson: Uniform direct product theorems: simplified, optimized, and derandomized. STOC 2008: 579-588 |
| i10 | | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson: Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. Electronic Colloquium on Computational Complexity (ECCC) 15(079) (2008) |
| 2007 | ||
| j6 | | Venkatesan Guruswami, Valentine Kabanets: Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword. Computational Complexity 16(2): 113-114 (2007) |
| c11 | | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Chernoff-Type Direct Product Theorems. CRYPTO 2007: 500-516 |
| i9 | | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka: The black-box query complexity of polynomial summation. Electronic Colloquium on Computational Complexity (ECCC) 14(125) (2007) |
| 2006 | ||
| c10 | | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. FOCS 2006: 187-196 |
| c9 | | Venkatesan Guruswami, Valentine Kabanets: Hardness Amplification Via Space-Efficient Direct Products. LATIN 2006: 556-568 |
| i8 | | Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam: Uniform Hardness Amplification in NP via Monotone Codes. Electronic Colloquium on Computational Complexity (ECCC) 13(154) (2006) |
| 2005 | ||
| c8 | | Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans: On the Complexity of Succinct Zero-Sum Games. IEEE Conference on Computational Complexity 2005: 323-332 |
| i7 | | Venkatesan Guruswami, Valentine Kabanets: Hardness amplification via space-efficient direct products. Electronic Colloquium on Computational Complexity (ECCC)(057) (2005) |
| 2004 | ||
| j5 | | Valentine Kabanets, Russell Impagliazzo: Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Computational Complexity 13(1-2): 1-46 (2004) |
| i6 | | Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans: On the complexity of succinct zero-sum games. Electronic Colloquium on Computational Complexity (ECCC)(001) (2004) |
| 2003 | ||
| j4 | | Valentine Kabanets: Almost k-wise independence and hard Boolean functions. Theor. Comput. Sci. 297(1-3): 281-295 (2003) |
| c7 | | Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi: The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. IEEE Conference on Computational Complexity 2003: 135- |
| c6 | | Valentine Kabanets, Russell Impagliazzo: Derandomizing polynomial identity tests means proving circuit lower bounds. STOC 2003: 355-364 |
| 2002 | ||
| j3 |  | |
| j2 | | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson: In search of an easy witness: exponential time vs. probabilistic polynomial time. J. Comput. Syst. Sci. 65(4): 672-694 (2002) |
| i5 | | Valentine Kabanets: Derandomization: A Brief Overview. Electronic Colloquium on Computational Complexity (ECCC)(008) (2002) |
| i4 | | Valentine Kabanets, Russell Impagliazzo: Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC)(055) (2002) |
| 2001 | ||
| j1 | | Valentine Kabanets: Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. J. Comput. Syst. Sci. 63(2): 236-252 (2001) |
| c5 | | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson: In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. IEEE Conference on Computational Complexity 2001: 2-12 |
| 2000 | ||
| c4 | | Valentine Kabanets: Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. IEEE Conference on Computational Complexity 2000: 150-157 |
| c3 | | |
| c2 | | |
| i3 | | Valentine Kabanets, Charles Rackoff, Stephen A. Cook: Efficiently Approximable Real-Valued Functions. Electronic Colloquium on Computational Complexity (ECCC) 7(34) (2000) |
| 1999 | ||
| i2 | | Valentine Kabanets: Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 6(4) (1999) |
| i1 | | Valentine Kabanets, Jin-yi Cai: Circuit Minimization Problem. Electronic Colloquium on Computational Complexity (ECCC)(45) (1999) |
| 1997 | ||
| c1 | | |
Data released under the ODC-BY 1.0 license — See also our legal information page