The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Avi Wigderson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard M. Karp, Eli Upfal, Avi Wigderson
    Constructing a Perfect Matching is in Random NC [Citation Graph (1, 0)][DBLP]
    STOC, 1985, pp:22-32 [Conf]
  2. Irit Dinur, Madhu Sudan, Avi Wigderson
    Robust Local Testability of Tensor Products of LDPC Codes. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:304-315 [Conf]
  3. Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
    A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:52-66 [Conf]
  4. Eli Ben-Sasson, Avi Wigderson
    Short Proofs Are Narrow - Resolution Made Simple (Abstract). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:2- [Conf]
  5. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson
    Deterministic Amplification of Space-Bounded Probabilistic Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:188-0 [Conf]
  6. Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Randomness Conductors and Constant-Degree Lossless Expanders. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:15- [Conf]
  7. Johan Håstad, Avi Wigderson
    Simple Analysis of Graph Tests for Linearity and PCP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:244-254 [Conf]
  8. Rafi Heiman, Ilan Newman, Avi Wigderson
    On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:78-87 [Conf]
  9. Rafi Heiman, Avi Wigderson
    Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:172-179 [Conf]
  10. 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]
  11. 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]
  12. Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
    Non-deterministic Communication Complexity with Few Witness. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:275-281 [Conf]
  13. Mauricio Karchmer, Ran Raz, Avi Wigderson
    Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:299-304 [Conf]
  14. Mauricio Karchmer, Avi Wigderson
    On Span Programs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:102-111 [Conf]
  15. Roy Meshulam, Avi Wigderson
    Expanders from Symmetric Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:16- [Conf]
  16. Ilan Newman, Prabhakar Ragde, Avi Wigderson
    Perfect Hashing, Graph Entropy, and Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:91-99 [Conf]
  17. Amir Shpilka, Avi Wigderson
    Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:87-0 [Conf]
  18. Avi Wigderson
    Applications of the Sum-Product Theorem in Finite Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:111- [Conf]
  19. Avi Wigderson
    NL/poly <= +/poly (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:59-62 [Conf]
  20. Avi Wigderson
    De-Randomizing BPP: The State of the Art. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:76-0 [Conf]
  21. Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
    Efficient Identification Schemes Using Two Prover Interactive Proofs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:498-506 [Conf]
  22. Ivan Damgård, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson
    Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:325-338 [Conf]
  23. Oded Goldreich, Silvio Micali, Avi Wigderson
    How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:171-185 [Conf]
  24. Danny Dolev, Avi Wigderson
    On the Security of Multi-Party Protocols in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:167-175 [Conf]
  25. Miklós Ajtai, Avi Wigderson
    Deterministic Simulation of Probabilistic Constant Depth Circuits (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:11-19 [Conf]
  26. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:43-53 [Conf]
  27. Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson
    Multi-Layer Grid Embeddings [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:186-196 [Conf]
  28. Noga Alon, Alexander Lubotzky, Avi Wigderson
    Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:630-637 [Conf]
  29. Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
    The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:342-351 [Conf]
  30. Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou
    Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:412-421 [Conf]
  31. Boaz Barak, Russell Impagliazzo, Avi Wigderson
    Extracting Randomness Using Few Independent Sources. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:384-393 [Conf]
  32. Aviad Cohen, Avi Wigderson
    Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:14-19 [Conf]
  33. Oded Goldreich, Silvio Micali, Avi Wigderson
    Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:174-187 [Conf]
  34. Friedhelm Meyer auf der Heide, Avi Wigderson
    The Complexity of Parallel Sorting [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:532-540 [Conf]
  35. 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]
  36. Russell Impagliazzo, Avi Wigderson
    Randomness vs. Time: De-Randomization under a Uniform Assumption. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:734-743 [Conf]
  37. Richard M. Karp, Michael E. Saks, Avi Wigderson
    On a Search Problem Related to Branch-and-Bound Procedures [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:19-28 [Conf]
  38. Richard M. Karp, Eli Upfal, Avi Wigderson
    The Complexity of Parallel Computation on Matroids [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:541-550 [Conf]
  39. Nathan Linial, László Lovász, Avi Wigderson
    A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:39-48 [Conf]
  40. László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
    Search Problems in the Decision Tree Model (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:576-585 [Conf]
  41. Noam Nisan, Endre Szemerédi, Avi Wigderson
    Undirected Connectivity in O(log ^1.5 n) Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:24-29 [Conf]
  42. Noam Nisan, Avi Wigderson
    Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:16-25 [Conf]
  43. Noam Nisan, Avi Wigderson
    Hardness vs. Randomness (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:2-11 [Conf]
  44. Noam Nisan, Avi Wigderson
    On Rank vs. Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:831-836 [Conf]
  45. Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
    Quadratic Dynamical Systems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:304-313 [Conf]
  46. Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:3-13 [Conf]
  47. Ran Raz, Avi Wigderson
    Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:562-567 [Conf]
  48. Michael E. Saks, Avi Wigderson
    Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:29-38 [Conf]
  49. Omer Reingold, Ronen Shaltiel, Avi Wigderson
    Extracting Randomness via Repeated Condensing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:22-31 [Conf]
  50. Eli Upfal, Avi Wigderson
    How to Share Memory in a Distributed System (A Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:171-180 [Conf]
  51. Uzi Vishkin, Avi Wigderson
    Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:146-153 [Conf]
  52. Avi Wigderson, David Xiao
    A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:397-406 [Conf]
  53. Avi Wigderson
    Zigzag Products, Expander Constructions, Connections, and Applications. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:443- [Conf]
  54. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:50-59 [Conf]
  55. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On Interactive Proofs with a Laconic Prover. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:334-345 [Conf]
  56. Oded Goldreich, Avi Wigderson
    On Pseudorandomness with respect to Deterministic Observes. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:77-84 [Conf]
  57. Avi Wigderson
    Do Probabilistic Algorithms Outperform Deterministic Ones? [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:212-214 [Conf]
  58. Yuri Rabinovich, Avi Wigderson
    An Analysis of a Simple Genetic Algorithm. [Citation Graph (0, 0)][DBLP]
    ICGA, 1991, pp:215-221 [Conf]
  59. Avi Wigderson
    The Wonders of the Digital Envelope - A Crash Course in Modern Cryptography. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:235-238 [Conf]
  60. Michael Luby, Boban Velickovic, Avi Wigderson
    Deterministic Approximate Counting of Depth-2 Circuits. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:18-24 [Conf]
  61. Rafail Ostrovsky, Avi Wigderson
    One-Way Fuctions are Essential for Non-Trivial Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:3-17 [Conf]
  62. Roded Sharan, Avi Wigderson
    A New NCAlgorithm for Perfect Matching in Bipartite Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:202-207 [Conf]
  63. Avi Wigderson
    Computational Pseudo-Randomness. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:218-219 [Conf]
  64. Avi Wigderson
    The Power and Weakness of Randomness in Computation. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:28-29 [Conf]
  65. Oded Goldreich, Silvio Micali, Avi Wigderson
    Proofs that Release Minimum Knowledge. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:639-650 [Conf]
  66. Avi Wigderson
    The Complexity of Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:112-132 [Conf]
  67. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Relations Between Concurrent-Write Models of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    PODC, 1984, pp:179-189 [Conf]
  68. Oded Goldreich, Avi Wigderson
    Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:209-223 [Conf]
  69. Oded Goldreich, Avi Wigderson
    Improved Derandomization of BPP Using a Hitting Set Generator. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:131-137 [Conf]
  70. Boaz Barak, Ronen Shaltiel, Avi Wigderson
    Computational Analogues of Entropy. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:200-215 [Conf]
  71. Ehud Friedgut, Jeff Kahn, Avi Wigderson
    Computing Graph Properties by Randomized Subcube Partitions. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:105-113 [Conf]
  72. Avi Wigderson
    Probabilistic and Deterministic Approximations of the Permanent (abstract). [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:130- [Conf]
  73. Faith E. Fich, Avi Wigderson
    Towards Understanding Exclusive Read. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:76-82 [Conf]
  74. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:353-358 [Conf]
  75. Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson
    On Computations with Integer Division. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:29-37 [Conf]
  76. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space complexity in propositional calculus. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:358-367 [Conf]
  77. Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou
    SL <= L4/3. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:230-239 [Conf]
  78. László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, Avi Wigderson
    Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:603-611 [Conf]
  79. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
    Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:1-10 [Conf]
  80. Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson
    2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:671-680 [Conf]
  81. Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson
    On the Power of Randomization in Online Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:379-386 [Conf]
  82. Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
    Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:113-131 [Conf]
  83. Michael Ben-Or, Shafi Goldwasser, Avi Wigderson
    Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:1-10 [Conf]
  84. Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson
    Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:612-621 [Conf]
  85. Eli Ben-Sasson, Avi Wigderson
    Short Proofs are Narrow - Resolution Made Simple. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:517-526 [Conf]
  86. Harry Buhrman, Richard Cleve, Avi Wigderson
    Quantum vs. Classical Communication and Computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:63-68 [Conf]
  87. Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Randomness conductors and constant-degree lossless expanders. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:659-668 [Conf]
  88. Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson
    On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:676-685 [Conf]
  89. Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson
    Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:42-51 [Conf]
  90. Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson
    One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:48-58 [Conf]
  91. Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson
    Self-Testing/Correcting for Polynomials and for Approximate Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:32-42 [Conf]
  92. Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson
    Not All Keys Can Be Hashed in Constant Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:244-253 [Conf]
  93. Oded Goldreich, Silvio Micali, Avi Wigderson
    How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:218-229 [Conf]
  94. Oded Goldreich, Avi Wigderson
    Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:574-584 [Conf]
  95. Russell Impagliazzo, Noam Nisan, Avi Wigderson
    Pseudorandomness for network algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:356-364 [Conf]
  96. 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]
  97. 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]
  98. Mauricio Karchmer, Avi Wigderson
    Monotone Circuits for Connectivity Require Super-logarithmic Depth [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:539-550 [Conf]
  99. Mauricio Karchmer, Avi Wigderson
    Characterizing non-deterministic circuit size. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:532-540 [Conf]
  100. Richard M. Karp, Eli Upfal, Avi Wigderson
    Are Search and Decision Problems Computationally Equivalent? [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:464-475 [Conf]
  101. Richard M. Karp, Avi Wigderson
    A Fast Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:266-272 [Conf]
  102. Nathan Linial, Alex Samorodnitsky, Avi Wigderson
    A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:644-652 [Conf]
  103. Douglas L. Long, Avi Wigderson
    How Discreet is the Discrete Log? [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:413-420 [Conf]
  104. Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Extractors: optimal up to constant factors. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:602-611 [Conf]
  105. Roy Meshulam, Avi Wigderson
    Expanders from symmetric codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:669-677 [Conf]
  106. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
    On data structures and asymmetric communication complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:103-111 [Conf]
  107. Noam Nisan, Avi Wigderson
    Rounds in Communication Complexity Revisited [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:419-429 [Conf]
  108. Noam Nisan, Avi Wigderson
    On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:723-732 [Conf]
  109. Itzhak Parnafes, Ran Raz, Avi Wigderson
    Direct Product Results and the GCD Problem, in Old and New Communication Models. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:363-372 [Conf]
  110. Ran Raz, Avi Wigderson
    Monotone Circuits for Matching Require Linear Depth [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:287-292 [Conf]
  111. Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao
    Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:739-748 [Conf]
  112. Eyal Rozenman, Aner Shalev, Avi Wigderson
    A new family of Cayley expanders (?). [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:445-454 [Conf]
  113. Amir Shpilka, Avi Wigderson
    Derandomizing homomorphism testing in general groups. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:427-435 [Conf]
  114. Avi Wigderson
    Depth through breadth, or why should we attend talks in other areas? [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:579- [Conf]
  115. Avi Wigderson
    A New Approximate Graph Coloring Algorithm [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:325-329 [Conf]
  116. Avi Wigderson
    The amazing power of pairwise independence (abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:645-647 [Conf]
  117. Avi Wigderson, David Zuckerman
    Expanders that beat the eigenvalue bound: explicit construction and applications. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:245-251 [Conf]
  118. Nimrod Megiddo, Avi Wigderson
    On Play by Means of Computing Machines. [Citation Graph (0, 0)][DBLP]
    TARK, 1986, pp:259-274 [Conf]
  119. Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson
    A Lower Bound on the Area of Permutation Layouts. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:2, pp:241-255 [Journal]
  120. Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson
    A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:543-547 [Journal]
  121. Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson
    On the Power of Randomization in On-Line Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:1, pp:2-14 [Journal]
  122. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Simulations Among Concurrent-Write PRAMs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:43-51 [Journal]
  123. Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman
    Derandomized Graph Products. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:1, pp:60-75 [Journal]
  124. László Babai, Lance Fortnow, Noam Nisan, Avi Wigderson
    BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:307-318 [Journal]
  125. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On interactive proofs with a laconic prover. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:1-2, pp:1-53 [Journal]
  126. Rafi Heiman, Avi Wigderson
    Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1991, v:1, n:, pp:311-329 [Journal]
  127. Mauricio Karchmer, Ran Raz, Avi Wigderson
    Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:3/4, pp:191-204 [Journal]
  128. Noam Nisan, Avi Wigderson
    Lower Bounds on Arithmetic Circuits Via Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:217-234 [Journal]
  129. Amir Shpilka, Avi Wigderson
    Depth-3 arithmetic circuits over fields of characteristic zero. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:1, pp:1-27 [Journal]
  130. László Babai, Anna Gál, Avi Wigderson
    Superpolynomial Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:3, pp:301-319 [Journal]
  131. 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]
  132. Joel Friedman, Avi Wigderson
    On the Second Eigenvalue of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:43-65 [Journal]
  133. Richard M. Karp, Eli Upfal, Avi Wigderson
    Constructing a perfect matching is in random NC. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:35-48 [Journal]
  134. Nathan Linial, László Lovász, Avi Wigderson
    Rubber bands, convex embeddings and graph connectivity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:91-102 [Journal]
  135. Nathan Linial, Alex Samorodnitsky, Avi Wigderson
    A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:545-568 [Journal]
  136. Roy Meshulam, Avi Wigderson
    Expanders In Group Algebras. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:4, pp:659-680 [Journal]
  137. Noam Nisan, Avi Wigderson
    On Rank vs. Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:557-565 [Journal]
  138. Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao
    Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:4, pp:555-574 [Journal]
  139. Avi Wigderson, David Zuckerman
    Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:1, pp:125-138 [Journal]
  140. Alexander A. Razborov, Endre Szemerédi, Avi Wigderson
    Constructing Small Sets that are Uniform in Arithmetic Progressions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:513-518 [Journal]
  141. Oded Goldreich, Avi Wigderson
    Theory of Computing: A Scientific Perspective. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:218- [Journal]
  142. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    Simplified derandomization of BPP using a hitting set generator. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:4, pp:- [Journal]
  143. 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]
  144. 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]
  145. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:23, pp:- [Journal]
  146. Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:18, pp:- [Journal]
  147. Oded Goldreich, Avi Wigderson
    On Pseudorandomness with respect to Deterministic Observers. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:56, pp:- [Journal]
  148. Omer Reingold, Ronen Shaltiel, Avi Wigderson
    Extracting Randomness via Repeated Condensing [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:59, pp:- [Journal]
  149. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On Interactive Proofs with a Laconic Prover [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:46, pp:- [Journal]
  150. Oded Goldreich, Avi Wigderson
    Derandomization that is rarely wrong from short advice that is typically good [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:039, pp:- [Journal]
  151. Avi Wigderson, David Xiao
    A Randomness-Efficient Sampler for Matrix-valued Functions and Applications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:107, pp:- [Journal]
  152. Noam Nisan, Avi Wigderson
    On Rank vs. Communication Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:1, pp:- [Journal]
  153. Oded Goldreich, Noam Nisan, Avi Wigderson
    On Yao's XOR-Lemma [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:50, pp:- [Journal]
  154. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson
    Deterministic Amplification of Space Bounded Probabilistic Algorithms. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:72, pp:- [Journal]
  155. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space Complexity in Propositional Calculus [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:40, pp:- [Journal]
  156. Hana Galperin, Avi Wigderson
    Succinct Representations of Graphs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:56, n:3, pp:183-198 [Journal]
  157. Uzi Vishkin, Avi Wigderson
    Dynamic Parallel Memories [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:56, n:3, pp:174-182 [Journal]
  158. Shlomo Hoory, Avi Wigderson
    Universal Traversal Sequences for Expander Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:2, pp:67-69 [Journal]
  159. Prabhakar Ragde, Avi Wigderson
    Linear-Size Constant-Depth Polylog-Treshold Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:3, pp:143-146 [Journal]
  160. Alexander A. Razborov, Avi Wigderson
    n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:6, pp:303-307 [Journal]
  161. Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson
    On Computations with Integer Division. [Citation Graph (0, 0)][DBLP]
    ITA, 1989, v:23, n:1, pp:101-111 [Journal]
  162. Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou
    An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:2, pp:294-311 [Journal]
  163. Eli Ben-Sasson, Avi Wigderson
    Short proofs are narrow - resolution made simple. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:2, pp:149-169 [Journal]
  164. Oded Goldreich, Silvio Micali, Avi Wigderson
    Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:3, pp:691-729 [Journal]
  165. Richard M. Karp, Avi Wigderson
    A Fast Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:762-773 [Journal]
  166. Ran Raz, Avi Wigderson
    Monotone Circuits for Matching Require Linear Depth. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:736-744 [Journal]
  167. Eli Upfal, Avi Wigderson
    How to share memory in a distributed system. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:116-127 [Journal]
  168. Avi Wigderson
    Improving the Performance Guarantee for Approximate Graph Coloring [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:4, pp:729-735 [Journal]
  169. 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]
  170. 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]
  171. Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
    Non-Deterministic Communication Complexity with Few Witnesses. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:247-257 [Journal]
  172. Richard M. Karp, Eli Upfal, Avi Wigderson
    The Complexity of Parallel Search. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:2, pp:225-253 [Journal]
  173. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
    On Data Structures and Asymmetric Communication Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:1, pp:37-49 [Journal]
  174. Noam Nisan, Avi Wigderson
    Hardness vs Randomness. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:149-167 [Journal]
  175. Anna Gál, Avi Wigderson
    Boolean complexity classes vs. their arithmetic analogs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:99-111 [Journal]
  176. Oded Goldreich, Avi Wigderson
    Tiny families of functions with random properties: A quality-size trade-off for hashing. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:4, pp:315-343 [Journal]
  177. Johan Håstad, Avi Wigderson
    Simple analysis of graph tests for linearity and PCP. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:2, pp:139-160 [Journal]
  178. Yuri Rabinovich, Avi Wigderson
    Techniques for bounding the convergence rate of genetic algorithms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:2, pp:111-138 [Journal]
  179. Noga Alon, Mauricio Karchmer, Avi Wigderson
    Linear Circuits over GF(2). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:1064-1067 [Journal]
  180. Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
    The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1570-1585 [Journal]
  181. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space Complexity in Propositional Calculus. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1184-1211 [Journal]
  182. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:67-88 [Journal]
  183. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:97-99 [Journal]
  184. Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson
    On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:739-762 [Journal]
  185. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Relations Between Concurrent-Write Models of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:606-627 [Journal]
  186. Faith E. Fich, Avi Wigderson
    Toward Understanding Exclusive Read. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:4, pp:718-727 [Journal]
  187. Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson
    The Tree Model for Hashing: Lower and Upper Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:5, pp:936-955 [Journal]
  188. Friedhelm Meyer auf der Heide, Avi Wigderson
    The Complexity of Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:100-107 [Journal]
  189. Douglas L. Long, Avi Wigderson
    The Discrete Logarithm Hides O(log n) Bits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:363-372 [Journal]
  190. Noam Nisan, Avi Wigderson
    Rounds in Communication Complexity Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:211-219 [Journal]
  191. Omer Reingold, Ronen Shaltiel, Avi Wigderson
    Extracting Randomness via Repeated Condensing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1185-1209 [Journal]
  192. Gopalakrishnan Vijayan, Avi Wigderson
    Rectilinear Graphs and their Embeddings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:355-372 [Journal]
  193. Uzi Vishkin, Avi Wigderson
    Trade-Offs Between Depth and Width in Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:303-314 [Journal]
  194. 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]
  195. Amir Shpilka, Avi Wigderson
    Derandomizing Homomorphism Testing in General Groups. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:1215-1230 [Journal]
  196. Mauricio Karchmer, Avi Wigderson
    Monotone Circuits for Connectivity Require Super-Logarithmic Depth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:2, pp:255-265 [Journal]
  197. Ilan Newman, Avi Wigderson
    Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:536-542 [Journal]
  198. László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
    Search Problems in the Decision Tree Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:119-132 [Journal]
  199. Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
    The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:399-410 [Journal]
  200. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:57-68 [Journal]
  201. Rafi Heiman, Ilan Newman, Avi Wigderson
    On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:107, n:1, pp:63-76 [Journal]
  202. Emanuele Viola, Avi Wigderson
    Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:141-154 [Conf]
  203. Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
    A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:4, pp:391-432 [Journal]
  204. 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]
  205. Joseph Gil, William L. Steiger, Avi Wigderson
    Geometric medians. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:37-51 [Journal]
  206. Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson
    Combinatorial characterization of read-once formulae. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:275-282 [Journal]

  207. Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. [Citation Graph (, )][DBLP]


  208. Relationless Completeness and Separations. [Citation Graph (, )][DBLP]


  209. Randomness - A Computational Complexity Perspective. [Citation Graph (, )][DBLP]


  210. Spherical Cubes and Rounding in High Dimensions. [Citation Graph (, )][DBLP]


  211. One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. [Citation Graph (, )][DBLP]


  212. Extractors and Rank Extractors for Polynomial Sources. [Citation Graph (, )][DBLP]


  213. Kakeya Sets, New Mergers and Old Extractors. [Citation Graph (, )][DBLP]


  214. Linear Systems over Composite Moduli. [Citation Graph (, )][DBLP]


  215. Randomness extractors -- applications and constructions. [Citation Graph (, )][DBLP]


  216. Towards a Study of Low-Complexity Graphs. [Citation Graph (, )][DBLP]


  217. Algebrization: a new barrier in complexity theory. [Citation Graph (, )][DBLP]


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


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


  220. The work of Leslie Valiant. [Citation Graph (, )][DBLP]


  221. Non-commutative circuits and the sum-of-squares problem. [Citation Graph (, )][DBLP]


  222. Public-key cryptography from different assumptions. [Citation Graph (, )][DBLP]


  223. Symmetric LDPC Codes and Local Testing. [Citation Graph (, )][DBLP]


  224. Extractors And Rank Extractors For Polynomial Sources. [Citation Graph (, )][DBLP]


  225. Neighborly Embedded Manifolds. [Citation Graph (, )][DBLP]


  226. Kakeya sets, new mergers and old extractors. [Citation Graph (, )][DBLP]


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


  228. Algebrization: A New Barrier in Complexity Theory. [Citation Graph (, )][DBLP]


  229. One-way multi-party communication lower bound for pointer jumping with applications. [Citation Graph (, )][DBLP]


  230. Extractors and Rank Extractors for Polynomial Sources. [Citation Graph (, )][DBLP]


  231. Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications. [Citation Graph (, )][DBLP]


  232. Robust Local Testability of Tensor Products of LDPC Codes. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.027secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002