( en | de | ru )

 

Disambiguation of "Raz, Ran"

Author of the publication

copydeleteadd this publication to your clipboard
Welfare Maximization with Limited Interaction.

, , , and . FOCS, page 1499-1512. IEEE Computer Society, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ran Ran

Raz Miri

Zeev Raz

Dorothea Raz

Richard Raz

 

Other publications of authors with the same name

Extractor-Based Time-Space Lower Bounds for Learning., , and . CoRR, (2017)Memory Delegation., , , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 151-168. Springer, (2011)On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors., and . ICALP Satellite Workshops, page 3-22. Carleton Scientific, Waterloo, Ontario, Canada, (2000)Space Pseudorandom Generators by Communication Complexity Lower Bounds., and . APPROX-RANDOM, volume 28 of LIPIcs, page 692-703. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Eliminating Intermediate Measurements using Pseudorandom Generators., and . CoRR, (2021)PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability., , , , and . Comput. Complex., 20 (3): 413-504 (2011)Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner., , and . ACM Trans. Algorithms, 12 (2): 25:1-25:16 (2016)Deterministic extractors for affine sources over large fields., and . Comb., 28 (4): 415-440 (2008)A Parallel Repetition Theorem for the GHZ Game., and . Electron. Colloquium Comput. Complex., (2020)Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines., and . Electron. Colloquium Comput. Complex., (2020)