Ran Raz: Publications:
Communication Complexity

  1. ``Exponential Separation of Information and Communication'' ,
    A.Ganor, G.Kol, R.Raz

  2. ``Space Pseudorandom Generators by Communication Complexity Lower Bounds'' ,
    A.Ganor, R.Raz

  3. ``Interactive Channel Capacity'' ,
    G.Kol, R.Raz,

  4. ``Arthur-Merlin Streaming Complexity'' ,
    T.Gur, R.Raz,

  5. ``Competing Provers Protocols for Circuit Evaluation'' ,
    G.Kol, R.Raz,

  6. ``Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors'',
    R.Raz, A.Yehudayoff,

  7. ``Exponential Separations for One-Way Quantum Communication Complexity, with Applications to Cryptography'',
    D.Gavinsky, J.Kempe, I.Kerenidis, R.Raz, R.de-Wolf,

  8. ``On the power of Quantum Proofs'',
    R.Raz, A.Shpilka,

  9. ``Circuit Complexity and Communication Complexity''
    (lecture notes series from IAS summer school on Complexity Theory),

  10. ``The BNS-Chung Criterion for Multi-Party Communication Complexity'',

  11. ``Exponential Separation of Quantum and Classical Communication Complexity'',

  12. ``Separation of the Monotone NC Hierarchy'',
    R.Raz, P.McKenzie,

  13. ``Direct Product Results and the GCD Problem, in Old and New Communication Models'',
    I.Parnafes, R.Raz, A.Wigderson,

  14. ``Fourier Analysis for Probabilistic Communication Complexity'',

  15. ``On the 'Log-Rank' Conjecture in Communication Complexity'',
    R.Raz, B.Spieker,

  16. ``On proving Super-Logarithmic Depth Lower Bounds via the Direct sum in Communication Complexity'',
    M.Karchmer, R.Raz, A.Wigderson,

  17. ``Monotone Circuits for Matching Require Linear Depth'',
    R.Raz, A.Wigderson,

  18. ``Probabilistic Communication Complexity of Boolean Relations'',
    R.Raz, A.Wigderson,