Ran Raz

7.4k citations
152 papers · 4.7k · 1 hit paper · h-index 35

Impact in

Papers in

    • Complexity and Algorithms in Graphs 104
    • Computability, Logic, AI Algorithms 24
    • Advanced Graph Theory Research 24
    • Cryptography and Data Security 53
    • Quantum Computing Algorithms and Architecture 27
    • Machine Learning and Algorithms 16
    • Coding theory and cryptography 14

Ran Raz

144 papers receiving 4.3k citations

Ran Raz's Hit Papers

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP 1997 · 603 citations
6030+9+19Years since publication200400600

Peers

Ran Raz
Comparison fields: 5 of 115
  • Computational Theory and Mathematics 3.3k
  • Computer Graphics and Computer-Aided Design 310
  • Artificial Intelligence 2.6k
  • Computational Mathematics 40
  • Discrete Mathematics and Combinatorics 123
Replace Marek Karpiński with:
Marek Karpiński Germany
Ryan Williams United States
Subhash Khot United States
Michael Ben-Or Israel
Ramamohan Paturi United States
Venkatesan Guruswami United States
Carsten Lund United States
Robert Krauthgamer Israel
Ryan O’Donnell United States
Leonid Khachiyan United States
Ran Raz relative to Marek Karpiński Germany Marek Karpiński's profile →
Citations per field
00.5×1.5×2.4×
Marek Karpiński · 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 152 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 →
1997603
2 1998478
3 2004364
4 2004141
5 1999131
6 1999116
7 200398
8 199293
9 201185
10 199781
11 200179
12 199978
13 200577
14 201474
15 200073
16 199871
17 199568
18 199564
19 199964
20 200059

About Ran Raz

Ran Raz is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications and Discrete Mathematics and Combinatorics, having authored 152 papers that have together received 4.7k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (104 papers), Cryptography and Data Security (53 papers), Quantum Computing Algorithms and Architecture (27 papers), Computability, Logic, AI Algorithms (24 papers), Advanced Graph Theory Research (24 papers), Machine Learning and Algorithms (16 papers), graph theory and CDMA systems (15 papers) and Coding theory and cryptography (14 papers). The work is most often cited by research in Computational Theory and Mathematics (3.3k citations), Computer Graphics and Computer-Aided Design (310 citations), Artificial Intelligence (2.6k citations), Computational Mathematics (40 citations) and Discrete Mathematics and Combinatorics (123 citations). Ran Raz has collaborated with scholars based in Israel, United States and Canada. Frequent co-authors include Muli Safra, Avi Wigderson, Hani Neuvirth, Gideon Schreiber, Yael Tauman Kalai, Amir Yehudayoff, Omer Reingold, Toniann Pitassi, Marı́a Luisa Bonet and Stéphane Pérennès. Their work appears in journals such as SIAM Journal on Computing, Computational Complexity, Journal of the ACM, COMBINATORICA and Theory of Computing.

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