Valentine Kabanets

2009
32	EE	Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Security Amplification for InteractiveCryptographic Primitives. TCC 2009: 128-145
31	EE	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Chernoff-Type Direct Product Theorems. J. Cryptology 22(1): 75-92 (2009)
2008
30	EE	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson: Uniform direct product theorems: simplified, optimized, and derandomized. STOC 2008: 579-588
29	EE	Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans: On the Complexity of Succinct Zero-Sum Games. Computational Complexity 17(3): 353-376 (2008)
28	EE	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	EE	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	EE	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Chernoff-Type Direct Product Theorems. CRYPTO 2007: 500-516
25	EE	Venkatesan Guruswami, Valentine Kabanets: Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword. Computational Complexity 16(2): 113-114 (2007)
24	EE	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	EE	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. FOCS 2006: 187-196
22	EE	Venkatesan Guruswami, Valentine Kabanets: Hardness Amplification Via Space-Efficient Direct Products. LATIN 2006: 556-568
21	EE	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	EE	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	EE	Venkatesan Guruswami, Valentine Kabanets: Hardness amplification via space-efficient direct products Electronic Colloquium on Computational Complexity (ECCC)(057): (2005)
2004
18	EE	Valentine Kabanets, Russell Impagliazzo: Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Computational Complexity 13(1-2): 1-46 (2004)
17	EE	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	EE	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	EE	Valentine Kabanets, Russell Impagliazzo: Derandomizing polynomial identity tests means proving circuit lower bounds. STOC 2003: 355-364
14	EE	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	EE	Valentine Kabanets: Derandomization: A Brief Overview Electronic Colloquium on Computational Complexity (ECCC)(008): (2002)
11	EE	Valentine Kabanets, Russell Impagliazzo: Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds Electronic Colloquium on Computational Complexity (ECCC)(055): (2002)
10	EE	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	EE	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	EE	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	EE	Valentine Kabanets, Jin-yi Cai: Circuit minimization problem. STOC 2000: 73-79
4	EE	Valentine Kabanets, Charles Rackoff, Stephen Cook: Efficiently Approximable Real-Valued Functions Electronic Colloquium on Computational Complexity (ECCC) 7(34): (2000)
1999
3	EE	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	EE	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

Coauthor Index

1	Joshua Buresh-Oppenheim (Josh Buresh-Oppenheim)	[21]
2	Jin-yi Cai	[2] [5]
3	Chris Calabro	[16] [27]
4	Stephen Cook	[4]
5	Yevgeniy Dodis	[32]
6	Lance Fortnow	[17] [20] [29]
7	Venkatesan Guruswami	[19] [22] [25]
8	Russell Impagliazzo	[9] [10] [11] [15] [16] [17] [18] [20] [23] [26] [27] [28] [29] [30] [31] [32]
9	Ragesh Jaiswal	[23] [26] [28] [30] [31] [32]
10	Ali Juma	[24]
11	Ramamohan Paturi	[16] [27]
12	Charles Rackoff	[4] [24]
13	Rahul Santhanam	[21]
14	Amir Shpilka	[24]
15	Christopher Umans	[17] [20] [29]
16	Avi Wigderson	[9] [10] [28] [30]

Colors in the list of coauthors