The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Valentine Kabanets: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi
    The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:135-0 [Conf]
  2. Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
    On the Complexity of Succinct Zero-Sum Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:323-332 [Conf]
  3. Russell Impagliazzo, Valentine Kabanets, Avi Wigderson
    In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:2-12 [Conf]
  4. Valentine Kabanets
    Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:150-157 [Conf]
  5. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
    Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:187-196 [Conf]
  6. Valentine Kabanets
    Recognizability Equals Definability for Partial k-Paths. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:805-815 [Conf]
  7. Venkatesan Guruswami, Valentine Kabanets
    Hardness Amplification Via Space-Efficient Direct Products. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:556-568 [Conf]
  8. Valentine Kabanets
    Almost k-Wise Independence and Hard Boolean Functions. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:197-206 [Conf]
  9. Valentine Kabanets, Jin-yi Cai
    Circuit minimization problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:73-79 [Conf]
  10. Valentine Kabanets, Russell Impagliazzo
    Derandomizing polynomial identity tests means proving circuit lower bounds. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:355-364 [Conf]
  11. Valentine Kabanets, Russell Impagliazzo
    Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2004, v:13, n:1-2, pp:1-46 [Journal]
  12. Valentine Kabanets
    Derandomization: a brief overview. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:76, n:, pp:88-103 [Journal]
  13. Valentine Kabanets, Charles Rackoff, Stephen Cook
    Efficiently Approximable Real-Valued Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:34, pp:- [Journal]
  14. Valentine Kabanets
    Derandomization: A Brief Overview [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:008, pp:- [Journal]
  15. Valentine Kabanets, Russell Impagliazzo
    Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:055, pp:- [Journal]
  16. Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
    On the complexity of succinct zero-sum games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:001, pp:- [Journal]
  17. Venkatesan Guruswami, Valentine Kabanets
    Hardness amplification via space-efficient direct products [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:057, pp:- [Journal]
  18. Valentine Kabanets
    Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:4, pp:- [Journal]
  19. Valentine Kabanets, Jin-yi Cai
    Circuit Minimization Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:45, pp:- [Journal]
  20. Russell Impagliazzo, Valentine Kabanets, Avi Wigderson
    In search of an easy witness: exponential time vs. probabilistic polynomial time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:672-694 [Journal]
  21. Valentine Kabanets
    Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:2, pp:236-252 [Journal]
  22. Valentine Kabanets
    Almost k-wise independence and hard Boolean functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:281-295 [Journal]
  23. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
    Chernoff-Type Direct Product Theorems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:500-516 [Conf]
  24. Venkatesan Guruswami, Valentine Kabanets
    Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:2, pp:113-114 [Journal]

  25. Constructive Proofs of Concentration Bounds. [Citation Graph (, )][DBLP]


  26. New direct-product testers and 2-query PCPs. [Citation Graph (, )][DBLP]


  27. Uniform direct product theorems: simplified, optimized, and derandomized. [Citation Graph (, )][DBLP]


  28. An axiomatic approach to algebrization. [Citation Graph (, )][DBLP]


  29. Security Amplification for InteractiveCryptographic Primitives. [Citation Graph (, )][DBLP]


  30. On the Complexity of Succinct Zero-Sum Games. [Citation Graph (, )][DBLP]


  31. Hardness Amplification via Space-Efficient Direct Products. [Citation Graph (, )][DBLP]


  32. The Black-Box Query Complexity of Polynomial Summation. [Citation Graph (, )][DBLP]


  33. Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. [Citation Graph (, )][DBLP]


  34. The black-box query complexity of polynomial summation. [Citation Graph (, )][DBLP]


  35. Uniform Hardness Amplification in NP via Monotone Codes. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002