The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Russell Impagliazzo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sashka Davis, Jeff Edmonds, Russell Impagliazzo
    Online Algorithms to Minimize Resource Reallocations and Network Communication. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:104-115 [Conf]
  2. Andrea E. F. Clementi, Russell Impagliazzo
    Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:73-90 [Conf]
  3. Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
    Memoization and DPLL: Formula Caching Proof Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:248-0 [Conf]
  4. Paul Beame, Russell Impagliazzo, Ashish Sabharwal
    Resolution Complexity of Independent Sets in Random Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:52-68 [Conf]
  5. Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
    Toward a Model for Backtracking and Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:308-322 [Conf]
  6. Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
    Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:5- [Conf]
  7. 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]
  8. Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
    A Duality between Clause Width and Clause Density for SAT. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:252-260 [Conf]
  9. 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]
  10. Giovanni Di Crescenzo, Russell Impagliazzo
    Proofs of Membership vs. Proofs of Knowledge. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:34-45 [Conf]
  11. Russell Impagliazzo
    A Personal View of Average-Case Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:134-147 [Conf]
  12. 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]
  13. Russell Impagliazzo, Philippe Moser
    A zero one law for RP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:48-52 [Conf]
  14. Russell Impagliazzo, Ramamohan Paturi
    Complexity of k-SAT. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:237-240 [Conf]
  15. Russell Impagliazzo, Ran Raz, Avi Wigderson
    A Direct Product Theorem. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:88-96 [Conf]
  16. Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
    Universal Languages and the Power of Diagonalization. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:337-346 [Conf]
  17. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:1-18 [Conf]
  18. Russell Impagliazzo, Steven Rudich
    Limits on the Provable Consequences of One-way Permutations. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:8-26 [Conf]
  19. Russell Impagliazzo, Moti Yung
    Direct Minimum-Knowledge Computations. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1987, pp:40-51 [Conf]
  20. Markus Jakobsson, Kazue Sako, Russell Impagliazzo
    Designated Verifier Proofs and Their Applications. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1996, pp:143-154 [Conf]
  21. Boaz Barak, Russell Impagliazzo, Avi Wigderson
    Extracting Randomness Using Few Independent Sources. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:384-393 [Conf]
  22. Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák
    Lower Bound on Hilbert's Nullstellensatz and propositional proofs [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:794-806 [Conf]
  23. Paul Beame, Russell Impagliazzo, Toniann Pitassi
    Improved Depth Lower Vounds for Small Distance Connectivity. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:692-701 [Conf]
  24. Mihir Bellare, Russell Impagliazzo, Moni Naor
    Does Parallel Repetition Lower the Error in Computationally Sound Protocols? [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:374-383 [Conf]
  25. Eli Ben-Sasson, Russell Impagliazzo
    Random CNF's are Hard for the Polynomial Calculus. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:415-421 [Conf]
  26. Manuel Blum, Russell Impagliazzo
    Generic Oracles and Oracle Classes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:118-126 [Conf]
  27. Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall
    Communication Complexity Towards Lower Bounds on Circuit Depth [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:249-257 [Conf]
  28. Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman
    Security Preserving Amplification of Hardness [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:318-326 [Conf]
  29. Arvind Gupta, Russell Impagliazzo
    Computing Planar Intertwines [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:802-811 [Conf]
  30. Russell Impagliazzo
    Hard-Core Distributions for Somewhat Hard Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:538-545 [Conf]
  31. Russell Impagliazzo, Bruce M. Kapron
    Logics for Reasoning about Cryptographic Constructions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:372-383 [Conf]
  32. Russell Impagliazzo, Michael Luby
    One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:230-235 [Conf]
  33. Russell Impagliazzo, Leonid A. Levin
    No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:812-821 [Conf]
  34. Russell Impagliazzo, Moni Naor
    Efficient Cryptographic Schemes Provably as Secure as Subset Sum [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:236-241 [Conf]
  35. Russell Impagliazzo, Ramamohan Paturi, Francis Zane
    Which Problems Have Strongly Exponential Complexity? [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:653-663 [Conf]
  36. Russell Impagliazzo, Nathan Segerlind
    Counting Axioms Do Not Polynomially Simulate Counting Gates. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:200-209 [Conf]
  37. Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
    Near-Optimal Conversion of Hardness into Pseudo-Randomness. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:181-190 [Conf]
  38. Russell Impagliazzo, Gábor Tardos
    Decision Versus Search Problems in Super-Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:222-227 [Conf]
  39. Russell Impagliazzo, Avi Wigderson
    Randomness vs. Time: De-Randomization under a Uniform Assumption. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:734-743 [Conf]
  40. Russell Impagliazzo, David Zuckerman
    How to Recycle Random Bits [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:248-253 [Conf]
  41. Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo
    A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:604-0 [Conf]
  42. 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]
  43. Russell Impagliazzo
    Computational Complexity Since 1980. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:19-47 [Conf]
  44. Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
    Homogenization and the Polynominal Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:926-937 [Conf]
  45. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
    On Dice and Coins: Models of Computation for Random Generation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:319-340 [Conf]
  46. Russell Impagliazzo, Nathan Segerlind
    Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:208-219 [Conf]
  47. Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart
    Upper and Lower Bounds for Tree-Like Cutting Planes Proofs [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:220-228 [Conf]
  48. Russell Impagliazzo
    Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:2-5 [Conf]
  49. Russell Impagliazzo
    Using Hard Problems to Derandomize Algorithms: An Incomplete Survey. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:165-173 [Conf]
  50. Ted Carson, Russell Impagliazzo
    Hill-climbing finds random planted bisections. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:903-909 [Conf]
  51. Sashka Davis, Russell Impagliazzo
    Models of greedy algorithms for graph problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:381-390 [Conf]
  52. Tassos Dimitriou, Russell Impagliazzo
    Go with the Winners for Graph Bisection. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:510-520 [Conf]
  53. Pavel Pudlák, Russell Impagliazzo
    A lower bound for DLL algorithms for k-SAT (preliminary version). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:128-136 [Conf]
  54. Giovanni Di Crescenzo, Niels Ferguson, Russell Impagliazzo, Markus Jakobsson
    How to Forget a Secret. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:500-509 [Conf]
  55. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
    Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:386-397 [Conf]
  56. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
    Reducing the Complexity of Reductions. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:730-738 [Conf]
  57. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
    The relative complexity of NP search problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:303-314 [Conf]
  58. Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods
    Exponential Lower Bounds for the Pigeonhole Principle [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:200-220 [Conf]
  59. Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
    Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:547-556 [Conf]
  60. Matthew Clegg, Jeff Edmonds, Russell Impagliazzo
    Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:174-183 [Conf]
  61. Giovanni Di Crescenzo, Russell Impagliazzo
    Security-Preserving Hardness-Amplification for Any Regular One-Way Function. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:169-178 [Conf]
  62. Tassos Dimitriou, Russell Impagliazzo
    Towards an Analysis of Local Optimization Algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:304-313 [Conf]
  63. Russell Impagliazzo
    Can every randomized algorithm be derandomized? [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:373-374 [Conf]
  64. Russell Impagliazzo, Leonid A. Levin, Michael Luby
    Pseudo-random Generation from one-way functions (Extended Abstracts) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:12-24 [Conf]
  65. Russell Impagliazzo, Noam Nisan, Avi Wigderson
    Pseudorandomness for network algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:356-364 [Conf]
  66. Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
    Size-depth trade-offs for threshold circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:541-550 [Conf]
  67. Russell Impagliazzo, Steven Rudich
    Limits on the Provable Consequences of One-Way Permutations [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:44-61 [Conf]
  68. Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
    Extractors and pseudo-random generators with optimal seed length. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:1-10 [Conf]
  69. Russell Impagliazzo, Avi Wigderson
    P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:220-229 [Conf]
  70. Valentine Kabanets, Russell Impagliazzo
    Derandomizing polynomial identity tests means proving circuit lower bounds. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:355-364 [Conf]
  71. Russell Impagliazzo, Sara Miner More
    Anonymous credentials with biometrically-enforced non-transferability. [Citation Graph (0, 0)][DBLP]
    WPES, 2003, pp:60-71 [Conf]
  72. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
    Reducing the complexity of reductions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:117-138 [Journal]
  73. Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jiri Sgall
    Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:256-298 [Journal]
  74. Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall
    Communication complexity towards lower bounds on circuit depth. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:3, pp:210-246 [Journal]
  75. Paul Beame, Russell Impagliazzo, Toniann Pitassi
    Improved Depth Lower Bounds for Small Distance Connectivity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:4, pp:325-345 [Journal]
  76. Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
    Homogenization and the polynomial calculus. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:91-108 [Journal]
  77. Russell Impagliazzo, Pavel Pudlák, Jiri Sgall
    Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:2, pp:127-144 [Journal]
  78. 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]
  79. Toniann Pitassi, Paul Beame, Russell Impagliazzo
    Exponential Lower Bounds for the Pigeonhole Principle. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:97-140 [Journal]
  80. Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson
    Near Optimal Separation Of Tree-Like And General Resolution. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:4, pp:585-603 [Journal]
  81. Russell Impagliazzo
    Hardness as randomness: a survey of universal derandomization [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  82. Russell Impagliazzo, Nathan Segerlind
    Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  83. Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson
    Near-Optimal Separation of Treelike and General Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:5, pp:- [Journal]
  84. Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
    Extractors and pseudo-random generators with optimal seed length [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:9, pp:- [Journal]
  85. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:057, pp:- [Journal]
  86. 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]
  87. 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]
  88. Sashka Davis, Russell Impagliazzo
    Models of Greedy Algorithms for Graph Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:120, pp:- [Journal]
  89. Russell Impagliazzo, Pavel Pudlák, Jiri Sgall
    Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:42, pp:- [Journal]
  90. Stephen A. Cook, Russell Impagliazzo, Tomoyuki Yamakami
    A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:137, n:2, pp:159-170 [Journal]
  91. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
    On Dice and Coins: Models of Computation for Random Generation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:2, pp:159-174 [Journal]
  92. Andrea E. F. Clementi, Russell Impagliazzo
    The Reachability Problem for Finite Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:1, pp:27-31 [Journal]
  93. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
    The Relative Complexity of NP Search Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:1, pp:3-19 [Journal]
  94. Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
    Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:267-289 [Journal]
  95. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
    Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:1, pp:104-111 [Journal]
  96. Russell Impagliazzo, Bruce M. Kapron
    Logics for reasoning about cryptographic constructions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:286-320 [Journal]
  97. 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]
  98. Russell Impagliazzo, Ramamohan Paturi
    On the Complexity of k-SAT. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:367-375 [Journal]
  99. Russell Impagliazzo, Ramamohan Paturi, Francis Zane
    Which Problems Have Strongly Exponential Complexity? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:512-530 [Journal]
  100. Russell Impagliazzo, Avi Wigderson
    Randomness vs Time: Derandomization under a Uniform Assumption. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:672-688 [Journal]
  101. Russell Impagliazzo, Moni Naor
    Efficient Cryptographic Schemes Provably as Secure as Subset Sum. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:4, pp:199-216 [Journal]
  102. Russell Impagliazzo, Jan Krajícek
    A Note on Conservativity Relations among Bounded Arithmetic Theories. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:3, pp:375-377 [Journal]
  103. Russell Impagliazzo, Noam Nisan
    The Effect of Random Restrictions on Formula Size. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:2, pp:121-134 [Journal]
  104. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
    A Pseudorandom Generator from any One-way Function. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1364-1396 [Journal]
  105. Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
    Size-Depth Tradeoffs for Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:693-707 [Journal]
  106. Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo
    A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:5, pp:1171-1200 [Journal]
  107. Boaz Barak, Russell Impagliazzo, Avi Wigderson
    Extracting Randomness Using Few Independent Sources. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:1095-1118 [Journal]
  108. Arvind Gupta, Russell Impagliazzo
    Bounding the Size of Planar Intertwines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:337-358 [Journal]
  109. Russell Impagliazzo, Nathan Segerlind
    Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:2, pp:199-218 [Journal]
  110. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
    Chernoff-Type Direct Product Theorems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:500-516 [Conf]
  111. Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
    Reducing The Seed Length In The Nisan-Wigderson Generator. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:6, pp:647-681 [Journal]

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


  113. Communication Complexity with Synchronized Clocks. [Citation Graph (, )][DBLP]


  114. The Complexity of Satisfiability of Small Depth Circuits. [Citation Graph (, )][DBLP]


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


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


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


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


  119. Models of Greedy Algorithms for Graph Problems. [Citation Graph (, )][DBLP]


  120. The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs. [Citation Graph (, )][DBLP]


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


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


  123. Formula Caching in DPLL. [Citation Graph (, )][DBLP]


  124. Infinitely-Often Universal Languages and Diagonalization. [Citation Graph (, )][DBLP]


Search in 0.077secs, Finished in 0.084secs
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