Ran Raz

8.5k citations
150 papers · 5.9k · 2 hit papers · h-index 41

Impact in

Papers in

    • Complexity and Algorithms in Graphs 118
    • Computability, Logic, AI Algorithms 23
    • Cryptography and Data Security 23
    • Quantum Computing Algorithms and Architecture 18
    • Coding theory and cryptography 15
    • Quantum Information and Cryptography 10
    • Machine Learning and Algorithms 6

Ran Raz

147 papers receiving 5.4k citations

Ran Raz's Hit Papers

A Parallel Repetition Theorem 1998 · 518 citations
5180+9+19Years since publication200400600

Peers

Ran Raz
Comparison fields: 5 of 80
  • Computational Theory and Mathematics 3.9k
  • Discrete Mathematics and Combinatorics 351
  • Artificial Intelligence 2.1k
  • Computational Mathematics 22
  • Computer Graphics and Computer-Aided Design 74
Replace Mark Jerrum with:
Mark Jerrum United Kingdom
Marek Karpiński Germany
Venkatesan Guruswami United States
Ryan O’Donnell United States
Márió Szegedy United States
Carsten Lund United States
Luca Trevisan United States
Leonard J. Schulman United States
Russell Impagliazzo United States
Michael Saks United States
Ran Raz relative to Mark Jerrum United Kingdom Mark Jerrum's profile →
Citations per field
00.5×1.7×
Mark Jerrum · 1×
Citations per year

Countries citing papers authored by Ran Raz

Since Specialization
Citations

This map shows the geographic impact of Ran Raz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ran Raz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ran Raz more than expected).

Fields of papers citing papers by Ran Raz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ran Raz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ran Raz. The network helps show where Ran Raz may publish in the future.

Co-authors

The 25 scholars most cited alongside Ran Raz, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Ran Raz Line = papers co-authored together Ran Raz links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 150 papers — load more, or switch the sort, to bring in the rest.

#Work
1
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
Hit paper breakdown →
1997609
2
A Parallel Repetition Theorem
Hit paper breakdown →
1998518
3 2004367
4 2004165
5 1999151
6 1999121
7 2005111
8 2003110
9 2004110
10 2008107
11 1992102
12 199997
13 201197
14 199791
15 201487
16 200586
17 200183
18 200082
19 200782
20 200276

About Ran Raz

Ran Raz is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Management Science and Operations Research and Computer Graphics and Computer-Aided Design, having authored 150 papers that have together received 5.9k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (118 papers), Cryptography and Data Security (23 papers), Computability, Logic, AI Algorithms (23 papers), Quantum Computing Algorithms and Architecture (18 papers), Coding theory and cryptography (15 papers), Limits and Structures in Graph Theory (10 papers), Quantum Information and Cryptography (10 papers) and Machine Learning and Algorithms (6 papers). The work is most often cited by research in Computational Theory and Mathematics (3.9k citations), Discrete Mathematics and Combinatorics (351 citations), Artificial Intelligence (2.1k citations), Computational Mathematics (22 citations) and Computer Graphics and Computer-Aided Design (74 citations). Ran Raz has collaborated with scholars based in Israel, United States and Canada. Frequent co-authors include Muli Safra, Avi Wigderson, Yael Tauman Kalai, Hani Neuvirth, Gideon Schreiber, Omer Reingold, Amir Yehudayoff, Toniann Pitassi, Amir Shpilka and Dana Moshkovitz. Their work appears in journals such as SIAM Journal on Computing, Computational Complexity, Journal of the ACM, COMBINATORICA and Journal of Computer and System Sciences.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact