The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ran Raz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, Ran Raz
    Improved Randomness Extraction from Two Independent Sources. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:334-344 [Conf]
  2. Ran Raz
    Resolution Lower Bounds for the Weak Pigeonhole Principle. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:3- [Conf]
  3. 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]
  4. 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]
  5. Ran Raz, Amir Shpilka
    Deterministic Polynomial Identity Testing in Non-Commutative Models. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:215-222 [Conf]
  6. Ran Raz, Amir Shpilka
    On the Power of Quantum Proofs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:260-274 [Conf]
  7. Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin
    Arthur-Merlin Games in Boolean Decision Trees. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:58-67 [Conf]
  8. Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
    Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:583-592 [Conf]
  9. Maria Luisa Bonet, Toniann Pitassi, Ran Raz
    No Feasible Interpolation for TC0-Frege Proofs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:254-263 [Conf]
  10. Ariel Gabizon, Ran Raz
    Deterministic Extractors for Affine Sources over Large Fields. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:407-418 [Conf]
  11. Ariel Gabizon, Ran Raz, Ronen Shaltiel
    Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:394-403 [Conf]
  12. Ran Raz
    Multilinear-NC neq Multilinear-NC. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:344-351 [Conf]
  13. Ran Raz
    Quantum Information and the PCP Theorem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:459-468 [Conf]
  14. Ran Raz, Pierre McKenzie
    Separation of the Monotone NC Hierarchy. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:234-243 [Conf]
  15. Ran Raz, Omer Reingold, Salil P. Vadhan
    Error Reduction for Extractors. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:191-201 [Conf]
  16. Ran Raz, Boris Spieker
    On the ``log rank''-Conjecture in Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:168-176 [Conf]
  17. Ran Raz, Avi Wigderson
    Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:562-567 [Conf]
  18. Yael Tauman Kalai, Ran Raz
    Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:355-366 [Conf]
  19. Tzvika Hartman, Ran Raz
    On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:3-22 [Conf]
  20. Dieter van Melkebeek, Ran Raz
    A Time Lower Bound for Satisfiability. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:971-982 [Conf]
  21. Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
    Distance labeling in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:210-219 [Conf]
  22. Maria Luisa Bonet, Toniann Pitassi, Ran Raz
    Lower bounds for cutting planes proofs with small coefficients. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:575-584 [Conf]
  23. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:29-40 [Conf]
  24. Danny Harnik, Ran Raz
    Higher lower bounds on monotone size. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:378-387 [Conf]
  25. Oded Lachish, Ran Raz
    Explicit lower bound of 4.5n - o(n) for boolena circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:399-408 [Conf]
  26. Dana Moshkovitz, Ran Raz
    Sub-constant error low degree test of almost-linear size. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:21-30 [Conf]
  27. 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]
  28. Ran Raz
    On the complexity of matrix product. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:144-151 [Conf]
  29. Ran Raz
    Multi-linear formulas for permanent and determinant are of super-polynomial size. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:633-641 [Conf]
  30. Ran Raz
    Extractors with weak random seeds. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:11-20 [Conf]
  31. Toniann Pitassi, Ran Raz
    Regular resolution lower bounds for the weak pigeonhole principle. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:347-355 [Conf]
  32. Ran Raz
    Resolution lower bounds for the weak pigeonhole principle. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:553-562 [Conf]
  33. Ran Raz
    A parallel repetition theorem. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:447-456 [Conf]
  34. Ran Raz
    Exponential Separation of Quantum and Classical Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:358-367 [Conf]
  35. Ran Raz, Omer Reingold
    On Recycling the Randomness of States in Space Bounded Computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:159-168 [Conf]
  36. Ran Raz, Omer Reingold, Salil P. Vadhan
    Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:149-158 [Conf]
  37. Ran Raz, Amir Shpilka
    Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:409-418 [Conf]
  38. Ran Raz, Shmuel Safra
    A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:475-484 [Conf]
  39. Ran Raz, Avi Wigderson
    Monotone Circuits for Matching Require Linear Depth [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:287-292 [Conf]
  40. Ran Raz
    The BNS-Chung criterion for multi-party communication complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:2, pp:113-122 [Journal]
  41. Ran Raz
    Fourier Analysis for Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:3/4, pp:205-221 [Journal]
  42. 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]
  43. Ran Raz, Amir Shpilka
    Deterministic polynomial identity testing in non-commutative models. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:1, pp:1-19 [Journal]
  44. Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra
    Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:205-243 [Journal]
  45. Toniann Pitassi, Ran Raz
    Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:503-524 [Journal]
  46. Ran Raz
    VC-Dimension of Sets of Permutations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:2, pp:241-255 [Journal]
  47. Ran Raz, Pierre McKenzie
    Separation of the Monotone NC Hierarchy. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:3, pp:403-435 [Journal]
  48. Ran Raz, Boris Spieker
    On the ``Log Rank''-Conjecture in Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:567-588 [Journal]
  49. Ran Raz
    P != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  50. Yuri Rabinovich, Ran Raz
    Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:1, pp:79-94 [Journal]
  51. Ran Raz, Amir Shpilka
    Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:29, pp:- [Journal]
  52. Ran Raz
    Resolution Lower Bounds for the Weak Pigeonhole Principle [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:21, pp:- [Journal]
  53. Tzvika Hartman, Ran Raz
    On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:44, pp:- [Journal]
  54. Ran Raz
    On the Complexity of Matrix Product [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:012, pp:- [Journal]
  55. Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
    Bounded-depth Frege lower bounds for weaker pigeonhole principles [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:023, pp:- [Journal]
  56. Ran Raz
    Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:067, pp:- [Journal]
  57. Ran Raz
    Multilinear-NC1 != Multilinear-NC2 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:042, pp:- [Journal]
  58. Ran Raz
    Extractors with Weak Random Seeds [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:099, pp:- [Journal]
  59. Zeev Dvir, Ran Raz
    Analyzing Linear Mergers [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:025, pp:- [Journal]
  60. Ran Raz
    Quantum Information and the PCP Theorem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:038, pp:- [Journal]
  61. Dana Moshkovitz, Ran Raz
    Sub-Constant Error Low Degree Test of Almost Linear Size [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:086, pp:- [Journal]
  62. Ariel Gabizon, Ran Raz
    Deterministic Extractors for Affine Sources over Large Fields [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:108, pp:- [Journal]
  63. Ariel Gabizon, Ran Raz, Ronen Shaltiel
    Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:109, pp:- [Journal]
  64. Ran Raz, Iddo Tzameret
    The Strength of Multilinear Proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:001, pp:- [Journal]
  65. Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin
    Arthur-Merlin Games in Boolean Decision Trees [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:54, pp:- [Journal]
  66. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:66, pp:- [Journal]
  67. Ran Raz, Omer Reingold, Salil P. Vadhan
    Extracting All the Randomness and Reducing the Error in Trevisan's Extractors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:46, pp:- [Journal]
  68. Ran Raz
    Resolution lower bounds for the weak pigeonhole principle. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:115-138 [Journal]
  69. 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]
  70. Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
    Distance labeling in graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:1, pp:85-112 [Journal]
  71. Ran Raz, Omer Reingold, Salil P. Vadhan
    Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:1, pp:97-128 [Journal]
  72. Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin
    Arthur-Merlin Games in Boolean Decision Trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:346-372 [Journal]
  73. Maria Luisa Bonet, Toniann Pitassi, Ran Raz
    Lower Bounds for Cutting Planes Proofs with Small Coefficients. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:3, pp:708-728 [Journal]
  74. Tzvika Hartman, Ran Raz
    On the distribution of the number of roots of polynomials and explicit weak designs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:3, pp:235-263 [Journal]
  75. Maria Luisa Bonet, Toniann Pitassi, Ran Raz
    On Interpolation and Automatization for Frege Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:1939-1967 [Journal]
  76. Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
    Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:261-276 [Journal]
  77. Ran Raz
    On the Complexity of Matrix Product. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1356-1369 [Journal]
  78. Ran Raz
    A Parallel Repetition Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:763-803 [Journal]
  79. Ran Raz, Amir Shpilka
    Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:488-513 [Journal]
  80. Ariel Gabizon, Ran Raz, Ronen Shaltiel
    Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:1072-1094 [Journal]
  81. Dieter van Melkebeek, Ran Raz
    A time lower bound for satisfiability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:311-320 [Journal]
  82. Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
    Exponential separations for one-way quantum communication complexity, with applications to cryptography. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:516-525 [Conf]
  83. Iordanis Kerenidis, Ran Raz
    The one-way communication complexity of the Boolean Hidden Matching Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  84. Ran Raz, Iddo Tzameret
    Resolution over Linear Equations and Multilinear Proofs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  85. Strong Parallel Repetition Theorem for Free Projection Games. [Citation Graph (, )][DBLP]


  86. Parallel Repetition of Two Prover Games (Invited Survey). [Citation Graph (, )][DBLP]


  87. Lower Bounds and Separations for Constant Depth Multilinear Circuits. [Citation Graph (, )][DBLP]


  88. Probabilistically Checkable Arguments. [Citation Graph (, )][DBLP]


  89. A Counterexample to Strong Parallel Repetition. [Citation Graph (, )][DBLP]


  90. Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. [Citation Graph (, )][DBLP]


  91. A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. [Citation Graph (, )][DBLP]


  92. Two Query PCP with Sub-Constant Error. [Citation Graph (, )][DBLP]


  93. Interactive PCP. [Citation Graph (, )][DBLP]


  94. Elusive functions and lower bounds for arithmetic circuits. [Citation Graph (, )][DBLP]


  95. Tensor-rank and lower bounds for arithmetic formulas. [Citation Graph (, )][DBLP]


  96. Quantum Information and the PCP Theorem. [Citation Graph (, )][DBLP]


  97. Resolution over linear equations and multilinear proofs. [Citation Graph (, )][DBLP]


  98. The Strength of Multilinear Proofs. [Citation Graph (, )][DBLP]


  99. Balancing Syntactically Multilinear Arithmetic Circuits. [Citation Graph (, )][DBLP]


  100. Lower Bounds and Separations for Constant Depth Multilinear Circuits. [Citation Graph (, )][DBLP]


  101. Deterministic extractors for affine sources over large fields. [Citation Graph (, )][DBLP]


  102. Lower Bounds and Separations for Constant Depth Multilinear Circuits. [Citation Graph (, )][DBLP]


  103. A Counterexample to Strong Parallel Repetition. [Citation Graph (, )][DBLP]


  104. Elusive Functions and Lower Bounds for Arithmetic Circuits. [Citation Graph (, )][DBLP]


  105. Two Query PCP with Sub-Constant Error. [Citation Graph (, )][DBLP]


  106. Sub-Constant Error Probabilistically Checkable Proof of Almost Linear Size. [Citation Graph (, )][DBLP]


  107. Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. [Citation Graph (, )][DBLP]


  108. Interactive PCP. [Citation Graph (, )][DBLP]


  109. Resolution over Linear Equations and Multilinear Proofs. [Citation Graph (, )][DBLP]


  110. A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. [Citation Graph (, )][DBLP]


  111. The one-way communication complexity of the Boolean Hidden Matching Problem. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.013secs
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