Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Fairness through awareness
20121.6k citationsCynthia Dwork, Moritz Hardt et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Omer Reingold'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 Omer Reingold with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Omer Reingold more than expected).
This network shows the impact of papers produced by Omer Reingold. 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 Omer Reingold. The network helps show where Omer Reingold may publish in the future.
Co-authorship network of co-authors of Omer Reingold
This figure shows the co-authorship network connecting the top 25 collaborators of Omer Reingold.
A scholar is included among the top collaborators of Omer Reingold 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 Omer Reingold. Omer Reingold is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Murtagh, Jack, Omer Reingold, Aaron Sidford, & Salil Vadhan. (2021). . Theory of Computing. 17(1). 1–35.1 indexed citations
3.
Kim, Michael P., Omer Reingold, & Guy N. Rothblum. (2018). Fairness Through Computationally-Bounded Awareness. Neural Information Processing Systems. 31. 4842–4852.17 indexed citations
4.
Reingold, Omer, et al.. (2018). Multicalibration: Calibration for the (Computationally-Identifiable) Masses. International Conference on Machine Learning. 1939–1948.45 indexed citations
5.
Dwork, Cynthia, Vitaly Feldman, Moritz Hardt, et al.. (2017). Guilt-free data reuse. Communications of the ACM. 60(4). 86–93.10 indexed citations
6.
Meka, Raghu, Omer Reingold, Guy N. Rothblum, & Ron D. Rothblum. (2014). Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract).. International Colloquium on Automata, Languages and Programming. 859–870.2 indexed citations
7.
McGregor, Andrew, Ilya Mironov, Toniann Pitassi, et al.. (2011). The Limits of Two-Party Differential Privacy.. Electronic colloquium on computational complexity. 18. 106.18 indexed citations
8.
Reingold, Omer. (2009). Theory of cryptography : 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009 : proceedings. Springer eBooks.4 indexed citations
Haitner, Iftach, Danny Harnik, & Omer Reingold. (2006). Efficient pseudorandom generators from exponentially hard one-way functions.2 indexed citations
11.
Reingold, Omer, Luca Trevisan, & Salil Vadhan. (2005). Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem. Electronic colloquium on computational complexity.6 indexed citations
Naor, Moni & Omer Reingold. (1998). From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs.2 indexed citations
Naor, Moni & Omer Reingold. (1996). On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. IACR Cryptology ePrint Archive. 1996. 11.25 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.