World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
58
Citations
12343
World Ranking
3659
National Ranking
1748

Overview

Ran Raz is a researcher affiliated with Princeton University in the United States. Their work is primarily situated within the field of Computer Science, with a focus on subfields such as Artificial Intelligence, Computational Theory and Mathematics, Information Systems, Computer Networks and Communications, and Atomic and Molecular Physics, and Optics.

Their main research themes encompass Complexity and Algorithms in Graphs, Quantum Computing Algorithms and Architecture, Computability, Logic, AI Algorithms, Cryptography and Data Security, Quantum Information and Cryptography, Machine Learning and Algorithms, and Blockchain Technology Applications and Security.

Several frequent collaborators have contributed to their research, including Uma Girish, Wei Zhan, Yael Tauman Kalai, Kunal Mittal, and Justin Holmgren.

Ran Raz has published in various scientific venues, with a notable presence in arXiv (Cornell University) and Leibniz-Zentrum für Informatik (Schloss Dagstuhl). Other significant publication venues include Journal of the ACM, COMBINATORICA, and Computational Complexity.

Recent papers by Ran Raz include:

  • Oracle Separation of BQP and PH, 2022, Journal of the ACM

Additional coauthor-related papers relevant to the context include works by Yael Tauman Kalai and Uma Girish published in venues such as the Journal of the ACM, COMBINATORICA, and Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

Best Publications

  • A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

    Ran Raz;Shmuel Safra

  • A Parallel Repetition Theorem

    Ran Raz

  • Distance labeling in graphs

    Cyril Gavoille;David Peleg;Stéphane Pérennes;Ran Raz

  • Separation of the monotone NC hierarchy

    Ran Raz;Pierre McKenzie

  • Lower bounds for cutting planes proofs with small coefficients

    Maria Luisa Bonet;Toniann Pitassi;Ran Raz

  • Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

    I. Dinur;G. Kindler;R. Raz;S. Safra

  • Exponential separation of quantum and classical communication complexity

    Ran Raz

  • Extracting all the randomness and reducing the error in Trevisan's extractors

    Ran Raz;Omer Reingold;Salil Vadhan

  • On the Complexity of Matrix Product

    Ran Raz

  • Multi-linear formulas for permanent and determinant are of super-polynomial size

    Ran Raz

  • Exponential separations for one-way quantum communication complexity, with applications to cryptography

    Dmitry Gavinsky;Julia Kempe;Iordanis Kerenidis;Ran Raz

  • Monotone circuits for matching require linear depth

    Ran Raz;Avi Wigderson

  • Two-query PCP with subconstant error

    Dana Moshkovitz;Ran Raz

  • Extractors with weak random seeds

    Ran Raz

  • Oracle separation of BQP and PH

    Ran Raz;Avishay Tal

  • Improved randomness extraction from two independent sources

    Yevgeniy Dodis;Ariel Elbaz;Roberto Oliveira;Ran Raz

  • Deterministic extractors for affine sources over large fields

    Ariel Gabizon;Ran Raz

  • Deterministic polynomial identity testing in non-commutative models

    Ran Raz;Amir Shpilka

  • Memory delegation

    Kai-Min Chung;Yael Tauman Kalai;Feng-Hao Liu;Ran Raz

  • Lower Bounds and Separations for Constant Depth Multilinear Circuits

    Ran Raz;Amir Yehudayoff

  • Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography

    Dmitry Gavinsky;Julia Kempe;Iordanis Kerenidis;Ran Raz

  • Two Query PCP with Sub-Constant Error.

    Dana Moshkovitz;Ran Raz

Frequent Co-Authors

Amir Shpilka
Amir Shpilka Tel Aviv University
Avi Wigderson
Avi Wigderson Institute for Advanced Study
Toniann Pitassi
Toniann Pitassi Columbia University
Peter Bro Miltersen
Peter Bro Miltersen Aarhus University
Ivan Damgård
Ivan Damgård Aarhus University
Mark Braverman
Mark Braverman Princeton University
Omer Reingold
Omer Reingold Stanford University
Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Julia Kempe
Julia Kempe New York University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As you consider studying Computer Science in the USA, it’s worth exploring flexible online degrees that can boost your skills and open new career paths. Many professionals advance quickly by enrolling in online MBA programs, which combine tech expertise with essential business management skills.

For those aiming to earn a credential rapidly, there are excellent 1 year master's programs available online, allowing you to specialize in areas like data science, information technology, or cybersecurity without a lengthy time commitment.

If your goal is to enter the workforce fast, you might look into short careers that pay well. These programs offer targeted training for high-demand roles in tech and related fields, helping you start your career sooner.

Finally, with AI revolutionizing the industry, pursuing an ai degrees online is a strategic move. These specialized programs prepare you for roles in machine learning, automation, and big data.

Best Scientists Citing Ran Raz

Trending Scientists