 | 2009 |
|---|
| 36 |       | Russell Impagliazzo,
Valentine Kabanets,
Avi Wigderson:
New direct-product testers and 2-query PCPs.
STOC 2009: 131-140 |
| 35 | | Russell Impagliazzo,
Valentine Kabanets,
Antonina Kolokolova:
An axiomatic approach to algebrization.
STOC 2009: 695-704 |
| 34 | | Yevgeniy Dodis,
Russell Impagliazzo,
Ragesh Jaiswal,
Valentine Kabanets:
Security Amplification for InteractiveCryptographic Primitives.
TCC 2009: 128-145 |
| 33 | | Ali Juma,
Valentine Kabanets,
Charles Rackoff,
Amir Shpilka:
The Black-Box Query Complexity of Polynomial Summation.
Computational Complexity 18(1): 59-79 (2009) |
| 32 | | Russell Impagliazzo,
Ragesh Jaiswal,
Valentine Kabanets:
Chernoff-Type Direct Product Theorems.
J. Cryptology 22(1): 75-92 (2009) |
| 2008 |
|---|
| 31 | | Russell Impagliazzo,
Ragesh Jaiswal,
Valentine Kabanets,
Avi Wigderson:
Uniform direct product theorems: simplified, optimized, and derandomized.
STOC 2008: 579-588 |
| 30 | | Lance Fortnow,
Russell Impagliazzo,
Valentine Kabanets,
Christopher Umans:
On the Complexity of Succinct Zero-Sum Games.
Computational Complexity 17(3): 353-376 (2008) |
| 29 | | Venkatesan Guruswami,
Valentine Kabanets:
Hardness Amplification via Space-Efficient Direct Products.
Computational Complexity 17(4): 475-500 (2008) |
| 28 | | 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) |
| 27 | | 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) |
| 2007 |
|---|
| 26 | | Russell Impagliazzo,
Ragesh Jaiswal,
Valentine Kabanets:
Chernoff-Type Direct Product Theorems.
CRYPTO 2007: 500-516 |
| 25 | | Venkatesan Guruswami,
Valentine Kabanets:
Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword.
Computational Complexity 16(2): 113-114 (2007) |
| 24 | | 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 |
|---|
| 23 | | Russell Impagliazzo,
Ragesh Jaiswal,
Valentine Kabanets:
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification.
FOCS 2006: 187-196 |
| 22 | | Venkatesan Guruswami,
Valentine Kabanets:
Hardness Amplification Via Space-Efficient Direct Products.
LATIN 2006: 556-568 |
| 21 | | 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 |
|---|
| 20 | | Lance Fortnow,
Russell Impagliazzo,
Valentine Kabanets,
Christopher Umans:
On the Complexity of Succinct Zero-Sum Games.
IEEE Conference on Computational Complexity 2005: 323-332 |
| 19 | | Venkatesan Guruswami,
Valentine Kabanets:
Hardness amplification via space-efficient direct products
Electronic Colloquium on Computational Complexity (ECCC)(057): (2005) |
| 2004 |
|---|
| 18 | | Valentine Kabanets,
Russell Impagliazzo:
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds.
Computational Complexity 13(1-2): 1-46 (2004) |
| 17 | | 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 |
|---|
| 16 | | 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- |
| 15 | | Valentine Kabanets,
Russell Impagliazzo:
Derandomizing polynomial identity tests means proving circuit lower bounds.
STOC 2003: 355-364 |
| 14 | | Valentine Kabanets:
Almost k-wise independence and hard Boolean functions.
Theor. Comput. Sci. 297(1-3): 281-295 (2003) |
| 2002 |
|---|
| 13 |  | Valentine Kabanets:
Derandomization: a brief overview.
Bulletin of the EATCS 76: 88-103 (2002) |
| 12 | | Valentine Kabanets:
Derandomization: A Brief Overview
Electronic Colloquium on Computational Complexity (ECCC)(008): (2002) |
| 11 | | Valentine Kabanets,
Russell Impagliazzo:
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Electronic Colloquium on Computational Complexity (ECCC)(055): (2002) |
| 10 | | 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) |
| 2001 |
|---|
| 9 | | 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 |
| 8 | | Valentine Kabanets:
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error.
J. Comput. Syst. Sci. 63(2): 236-252 (2001) |
| 2000 |
|---|
| 7 | | Valentine Kabanets:
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error.
IEEE Conference on Computational Complexity 2000: 150-157 |
| 6 | | Valentine Kabanets:
Almost k-Wise Independence and Hard Boolean Functions.
LATIN 2000: 197-206 |
| 5 | | Valentine Kabanets,
Jin-yi Cai:
Circuit minimization problem.
STOC 2000: 73-79 |
| 4 | | Valentine Kabanets,
Charles Rackoff,
Stephen Cook:
Efficiently Approximable Real-Valued Functions
Electronic Colloquium on Computational Complexity (ECCC) 7(34): (2000) |
| 1999 |
|---|
| 3 | | Valentine Kabanets:
Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 6(4): (1999) |
| 2 | | Valentine Kabanets,
Jin-yi Cai:
Circuit Minimization Problem
Electronic Colloquium on Computational Complexity (ECCC)(45): (1999) |
| 1997 |
|---|
| 1 | | Valentine Kabanets:
Recognizability Equals Definability for Partial k-Paths.
ICALP 1997: 805-815 |
