| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ruiwen Chen, Valentine Kabanets |
Lower Bounds against Weakly Uniform Circuits.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Valentine Kabanets, Osamu Watanabe |
Is the Valiant-Vazirani Isolation Lemma Improvable? |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Russell Impagliazzo, Valentine Kabanets |
Constructive Proofs of Concentration Bounds. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson |
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Valentine Kabanets |
Constructive Proofs of Concentration Bounds. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
New Direct-Product Testers and 2-Query PCPs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka |
The Black-Box Query Complexity of Polynomial Summation. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q05, 68Q17, 68Q25, 68Q15 |
| 1 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
Chernoff-Type Direct Product Theorems. |
J. Cryptology |
2009 |
DBLP DOI BibTeX RDF |
Challenge-response protocols, Parallel repetition with threshold, Direct product theorem |
| 1 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
Security Amplification for InteractiveCryptographic Primitives. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
New direct-product testers and 2-query PCPs. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
testing, PCP, parallel repetition, direct products |
| 1 | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
An axiomatic approach to algebrization. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
algebrization, independence, relativization |
| 1 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson |
Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans |
On the Complexity of Succinct Zero-Sum Games. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
91A05, 68Q17, Subject classification. 68Q15, 03D15, 68Q32 |
| 1 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification via Space-Efficient Direct Products. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17 |
| 1 | Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi |
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson |
Uniform direct product theorems: simplified, optimized, and derandomized. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
direct product code, xor code, direct product theorem |
| 1 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka |
The black-box query complexity of polynomial summation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Valentine Kabanets |
Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
Chernoff-Type Direct Product Theorems. |
CRYPTO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam |
Uniform Hardness Amplification in NP via Monotone Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification Via Space-Efficient Direct Products. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
error-correcting codes, expanders, Direct products, hardness amplification |
| 1 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Valentine Kabanets |
Hardness amplification via space-efficient direct products |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans |
On the Complexity of Succinct Zero-Sum Games. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans |
On the complexity of succinct zero-sum games |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. |
Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
68Q17, 68Q15, Subject classification. 68Q10 |
| 1 | Valentine Kabanets |
Almost k-wise independence and hard Boolean functions. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing polynomial identity tests means proving circuit lower bounds. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing |
| 1 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Valentine Kabanets |
Derandomization: A Brief Overview |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Valentine Kabanets |
Derandomization: a brief overview. |
Bulletin of the EATCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
In search of an easy witness: exponential time vs. probabilistic polynomial time. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentine Kabanets |
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentine Kabanets, Charles Rackoff, Stephen A. Cook |
Efficiently Approximable Real-Valued Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Valentine Kabanets |
Almost k-Wise Independence and Hard Boolean Functions. |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentine Kabanets |
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
probabilistic complexity classes, uniform setting, derandomization |
| 1 | Valentine Kabanets, Jin-yi Cai |
Circuit minimization problem. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentine Kabanets |
Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Valentine Kabanets, Jin-yi Cai |
Circuit Minimization Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Valentine Kabanets |
Recognizability Equals Definability for Partial k-Paths. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")