Omer Reingold

12.3k total citations · 1 hit paper
97 papers, 4.1k citations indexed

About

Omer Reingold is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Omer Reingold has authored 97 papers receiving a total of 4.1k indexed citations (citations by other indexed papers that have themselves been cited), including 62 papers in Artificial Intelligence, 41 papers in Computational Theory and Mathematics and 13 papers in Computer Networks and Communications. Recurrent topics in Omer Reingold's work include Cryptography and Data Security (36 papers), Complexity and Algorithms in Graphs (34 papers) and Cryptographic Implementations and Security (15 papers). Omer Reingold is often cited by papers focused on Cryptography and Data Security (36 papers), Complexity and Algorithms in Graphs (34 papers) and Cryptographic Implementations and Security (15 papers). Omer Reingold collaborates with scholars based in United States, Israel and Canada. Omer Reingold's co-authors include Cynthia Dwork, Toniann Pitassi, Moritz Hardt, Richard S. Zemel, Moni Naor, Salil Vadhan, Avi Wigderson, Guy N. Rothblum, Ran Raz and Vitaly Feldman and has published in prestigious journals such as Science, Proceedings of the National Academy of Sciences and Communications of the ACM.

In The Last Decade

Omer Reingold

91 papers receiving 3.8k citations

Hit Papers

align trajectories

What are hit papers?

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

2012 1.6k citations Cynthia Dwork, Moritz Hardt et al. profile →

Peers

Countries citing papers authored by Omer Reingold

Since Specialization

Citations

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).

Fields of papers citing papers by Omer Reingold

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Dissenting Explanations: Leveraging Disagreement to Reduce Model Overreliance 2024 ·Proceedings of the AAAI Conference on Artificial Intelligence ·Omer Reingold, Judy Hanwen Shen, (unknown)	2
2	2021 ·Theory of Computing ·Jack Murtagh, Omer Reingold, Aaron Sidford, Salil Vadhan	1
3	Fairness Through Computationally-Bounded Awareness 2018 ·Neural Information Processing Systems ·Michael P. Kim, Omer Reingold, Guy N. Rothblum	17
4	Multicalibration: Calibration for the (Computationally-Identifiable) Masses 2018 ·International Conference on Machine Learning ·(unknown), (unknown), Omer Reingold, Guy N. Rothblum	45
5	Guilt-free data reuse 2017 ·Communications of the ACM ·Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth	10
6	Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). 2014 ·International Colloquium on Automata, Languages and Programming ·Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum	2
7	The Limits of Two-Party Differential Privacy. 2011 ·Electronic colloquium on computational complexity ·Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil Vadhan	18
8	Theory of cryptography : 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009 : proceedings 2009 ·Springer eBooks ·Omer Reingold	4
9	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments 2007 ·Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev	22
10	Efficient pseudorandom generators from exponentially hard one-way functions 2006 ·Iftach Haitner, Danny Harnik, Omer Reingold	2
11	Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem 2005 ·Electronic colloquium on computational complexity ·Omer Reingold, Luca Trevisan, Salil Vadhan	6
12	Error reduction for extractors 2003 ·Ran Raz, Omer Reingold, Salil Vadhan	15
13	Constructing pseudo-random permutations with a prescribed structure 2001 ·Symposium on Discrete Algorithms ·Moni Naor, Omer Reingold	1
14	On the impossibility of basing trapdoor functions on trapdoor predicates 2001 ·Yael Gertner, Tal Malkin, Omer Reingold	23
15	Extracting Randomness via Repeated Condensing 2000 ·Electronic colloquium on computational complexity ·Omer Reingold, Ronen Shaltiel, Avi Wigderson	1
16	Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions 1999 ·Journal of Computer and System Sciences ·Moni Naor, Omer Reingold	43
17	From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs 1998 ·Moni Naor, Omer Reingold	2
18	Perfectly One-Way Probabilistic Hash Functions 1998 ·Ran Canetti, Daniele Micciancio, Omer Reingold	9
19	Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring 1997 ·Electronic colloquium on computational complexity ·Eli Biham, Dan Boneh, Omer Reingold	2
20	On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited 1996 ·IACR Cryptology ePrint Archive ·Moni Naor, Omer Reingold	25

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