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).
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-authorship network of co-authors of Ran Raz
This figure shows the co-authorship network connecting the top 25 collaborators of Ran Raz.
A scholar is included among the top collaborators of Ran Raz based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Ran Raz. Ran Raz is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kol, Gillat & Ran Raz. (2014). . Theory of Computing. 10(1). 107–131.1 indexed citations
6.
Raz, Ran, et al.. (2013). Space Pseudorandom Generators by Communication Complexity Lower Bounds.. Electronic colloquium on computational complexity. 20. 64.3 indexed citations
7.
Cohen, Gil, Ivan Damgård, Yuval Ishai, et al.. (2013). Efficient Multiparty Protocols via Log-Depth Threshold Formulae (Extended Abstract). 185–202.1 indexed citations
8.
Komargodski, Ilan & Ran Raz. (2012). Average-Case Lower Bounds for Formula Size.. Electronic colloquium on computational complexity. 19. 62.2 indexed citations
9.
Cohen, Gil, Ran Raz, & Gil Segev. (2011). Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification.. Electronic colloquium on computational complexity. 18. 96.1 indexed citations
10.
Raz, Ran. (2010). . Theory of Computing. 6(1). 135–177.19 indexed citations
11.
Kol, Gillat & Ran Raz. (2009). Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist.. Electronic colloquium on computational complexity. 16. 128.2 indexed citations
12.
Raz, Ran. (2006). . Theory of Computing. 2(1). 121–135.41 indexed citations
13.
Dodis, Yevgeniy, et al.. (2004). Improved randomness extraction from two independent sources. 334–344.3 indexed citations
Lachish, Oded & Ran Raz. (2001). Explicit lower bound of 4.5n - o(n) for Boolean circuits. 399–408.17 indexed citations
17.
Gavoille, Cyril, David Peleg, Stéphane Pérennès, & Ran Raz. (2001). Distance labeling in graphs. Symposium on Discrete Algorithms. 210–219.61 indexed citations
18.
Hartman, Tzvika & Ran Raz. (2000). On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors. Electronic colloquium on computational complexity. 7. 3–22.5 indexed citations
19.
Raz, Ran, et al.. (1993). On the "log-rank"-conjecture in communication complexity. University of Twente Research Information.1 indexed citations
20.
Raz, Ran & Avi Wigderson. (1989). Probabilistic Communication Complexity of Boolean Relations (Extended Abstract). 562–567.4 indexed citations
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.