Omer Reingold

Q: What Schools Are Affiliated With Omer Reingold

Omer Reingold is affiliated with the following schools: Weizmann Institute of Science, Tel Aviv University, Stanford University

Omer Reingold's AcademicInfluence.com Rankings

Omer Reingold

Computer Science

#880

World Rank

#912

Historical Rank

Database

#2064

World Rank

#2169

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Omer Reingold's Degrees

PhD Computer Science Weizmann Institute of Science
Bachelors Computer Science Tel Aviv University

Similar Degrees You Can Earn

Why Is Omer Reingold Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Omer Reingold is an Israeli computer scientist. He is the Rajeev Motwani professor of Computer Science in the Computer Science Department at Stanford University and the director of the Simons Collaboration on the Theory of Algorithmic Fairness. He received a PhD in computer science at Weizmann in 1998 under Moni Naor. He received the 2005 Grace Murray Hopper Award for his work in finding a deterministic logarithmic-space algorithm for st-connectivity in undirected graphs. He, along with Avi Wigderson and Salil Vadhan, won the Gödel Prize for their work on the zig-zag product. He became a Fellow of the Association for Computing Machinery in 2014 "For contributions to the study of pseudorandomness, derandomization, and cryptography."

(See a Problem?)

Omer Reingold's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Fairness through awareness (2011) (2521)
Number-theoretic constructions of efficient pseudo-random functions (1997) (683)
Undirected connectivity in log-space (2008) (511)
Priced Oblivious Transfer: How to Sell Digital Goods (2001) (413)
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors (2000) (406)
On the complexity of differentially private data release: efficient algorithms and hardness results (2009) (403)
Keyword Search and Oblivious Pseudorandom Functions (2005) (386)
Preserving Statistical Validity in Adaptive Data Analysis (2014) (333)
The reusable holdout: Preserving validity in adaptive data analysis (2015) (300)
Undirected ST-connectivity in log-space (2005) (295)
Notions of Reducibility between Cryptographic Primitives (2004) (262)
Computational Differential Privacy (2009) (249)
Extracting all the randomness and reducing the error in Trevisan's extractors (1999) (222)
Distributed Pseudo-random Functions and KDCs (1999) (215)
Randomness conductors and constant-degree lossless expanders (2002) (214)
Generalization in Adaptive Data Analysis and Holdout Reuse (2015) (198)
The relationship between public key encryption and oblivious transfer (2000) (195)
The Limits of Two-Party Differential Privacy (2010) (178)
Multicalibration: Calibration for the (Computationally-Identifiable) Masses (2018) (177)
Assignment testers: towards a combinatorial proof of the PCP-theorem (2004) (176)
Constant-round interactive proofs for delegating computation (2016) (171)
Magic functions (1999) (169)
Synthesizers and their application to the parallel construction of pseudo-random functions (1995) (163)
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited (1996) (151)
Just fast keying: Key agreement in a hostile internet (2004) (150)
Extractors: optimal up to constant factors (2003) (149)
Perfectly one-way probabilistic hash functions (preliminary version) (1998) (134)
Dense Subsets of Pseudorandom Sets (2008) (127)
On Robust Combiners for Oblivious Transfer and Other Primitives (2005) (118)
ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE (2004) (117)
Fairness Through Computationally-Bounded Awareness (2018) (109)
On the impossibility of basing trapdoor functions on trapdoor predicates (2001) (105)
On recycling the randomness of states in space bounded computation (1999) (101)
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments (2007) (100)
Extracting randomness via repeated condensing (2000) (98)
Statistically-hiding commitment from any one-way function (2007) (95)
Derandomized Constructions of k-Wise (Almost) Independent Permutations (2005) (94)
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function (2009) (90)
Perfectly One-Way Probabilistic Hash Functions (1998) (90)
Immunizing Encryption Schemes from Decryption Errors (2004) (86)
Calibration for the (Computationally-Identifiable) Masses (2017) (83)
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract) (1997) (82)
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions (2013) (81)
Better Pseudorandom Generators from Milder Pseudorandom Restrictions (2012) (80)
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998 (2003) (77)
Pseudorandom walks on regular digraphs and the RL vs. L problem (2006) (70)
On the Power of the Randomized Iterate (2006) (68)
Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier (2001) (58)
Pseudorandomness for Regular Branching Programs via Fourier Analysis (2013) (58)
Inaccessible entropy (2009) (55)
DNF sparsification and a faster deterministic counting algorithm (2012) (54)
Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring (1999) (53)
From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract) (1998) (53)
Randomness conductors and constant-degree lossless expanders (2002) (53)
How Well Do Random Walks Parallelize? (2009) (51)
Error reduction for extractors (1999) (49)
Pseudorandom Functions and Factoring (2002) (47)
Balls and Bins: Smaller Hash Families and Faster Evaluation (2011) (46)
Fault tolerance in large games (2008) (44)
Incremental Deterministic Public-Key Encryption (2012) (41)
Pseudorandom generators for width-3 branching programs (2018) (38)
Pure Differential Privacy for Rectangle Queries via Private Partitions (2015) (37)
Pseudorandom generators for combinatorial shapes (2011) (36)
ERA: A Framework for Economic Resource Allocation for the Cloud (2017) (35)
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem (2007) (35)
Succinct Proofs for NP and Spooky Interactions (2004) (34)
New techniques and tighter bounds for local computation algorithms (2014) (34)
Outcome indistinguishability (2020) (34)
Universal One-Way Hash Functions via Inaccessible Entropy (2010) (33)
Constructing Pseudo-Random Permutations with a Prescribed Structure (2001) (32)
A New Interactive Hashing Theorem (2007) (31)
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (2006) (31)
Improved pseudorandomness for unordered branching programs through local monotonicity (2018) (29)
Completeness in Two-Party Secure Computation: A Computational View (2004) (28)
New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition (2008) (27)
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (2015) (27)
Pseudorandom Bit Generators That Fool Modular Sums (2009) (26)
Streaming computation of combinatorial objects (2002) (25)
Partial exposure in large games (2010) (23)
Pseudo-random functions and factoring (extended abstract) (2000) (23)
Guilt-free data reuse (2017) (22)
A note on ex-tracting randomness from Santha-Vazirani sources (2004) (17)
Learning from Outcomes: Evidence-Based Rankings (2019) (17)
Efficiency improvements in constructing pseudorandom generators from one-way functions (2010) (17)
Universal adaptability: Target-independent inference that competes with propensity scoring (2022) (17)
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (2017) (17)
S-T Connectivity on Digraphs with a Known Stationary Distribution (2007) (17)
Applied Kid Cryptography or How To Convince Your Children You Are Not Cheating (1999) (16)
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors (2002) (16)
Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem (2005) (16)
Tight bounds for shared memory systems accessed by Byzantine processes (2002) (16)
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract) (2014) (15)
Only valuable experts can be valued (2011) (13)
Pseudorandom Graphs in Data Structures (2014) (12)
Deterministic Approximation of Random Walks in Small Space (2019) (12)
Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring (1997) (10)
Equality and Social Mobility in Twitter Discussion Groups (2016) (10)
Efficient Batch Verification for UP (2018) (8)
Loss Minimization through the Lens of Outcome Indistinguishability (2022) (8)
Bounded-Leakage Differential Privacy (2020) (7)
Players' Effects Under Limited Independence (2009) (7)
Omnipredictors (2021) (7)
Tracking and Improving Information in the Service of Fairness (2019) (7)
Multicalibrated Partitions for Importance Weights (2021) (7)
On the Error Parameter of Dispersers (2005) (6)
Theory of Cryptography (2009) (6)
On the Communication Complexity of Key-Agreement Protocols (2021) (6)
A Pseudo-Random Encryption Mode (2014) (6)
Perfectly one-way probabilistic hashing (1998) (6)
Deterministic Coupon Collection and Better Strong Dispersers (2014) (6)
Monotone Branching Programs: Pseudorandomness and Circuit Complexity (2021) (5)
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions (2020) (5)
Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature (2022) (5)
Pseudorandom Generators for Read-Once Monotone Branching Programs (2021) (4)
Omnipredictors for Constrained Optimization (2022) (4)
A Pseudo-Random Encryption (1997) (3)
Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability (2022) (3)
DNF Sparsification and a Faster Deterministic Counting (2012) (3)
Universal One-Way Hash Functions via Inaccessible (2010) (3)
The Player's Effect (2008) (3)
Theory of cryptography : 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009 : proceedings (2009) (3)
Characterizing notions of omniprediction via multicalibration (2023) (2)
Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques (2007) (2)
Number-theoretic Constructions of Eecient Pseudo-random Functions Preliminary Version (1997) (2)
Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers (2020) (2)
Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009) (2)
When and How Can Data be Efficiently Released with Privacy ? (2008) (1)
Dense Subsets of Pseudorandom Sets (Extended Abstract) (2008) (1)
Completeness in Two-Party Secure Computation Revisited (2007) (1)
CS 369 E : Expanders May 16 , 2005 Lecture 8 : Undirected Connectivity is in logspace (2005) (1)
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing (2021) (1)
Through the lens of a passionate theoretician (2020) (1)
Pseudo-Random Permutations with a Pres ribed Stru ture (2012) (0)
On expander graphs and connectivity in small space (2006) (0)
Universal One-Way Hash Functions and Average Case Complexity via Inaccessible Entropy (2014) (0)
KL Divergence Estimation with Multi-group Attribution (2022) (0)
Distributed Pseudo-Random Functions andKDCsMoni Naor ? (2014) (0)
Undirected ST-Connectivity in Log-Space PRELIMINARY VERSION: PLEASE DO NOT DISTRIBUTE (2004) (0)
A New Interactive Hashing Theorem Iftach Haitner (2006) (0)
Computational Complexity: a Conceptual Perspective Organization and Chapter Summaries (0)
Adaptive Condorcet-Based Stopping Rules Can Be Efficient (2016) (0)
Dense Subsets of Pseudorandom Sets ∗ [ Extended (2008) (0)
Randomness Conductors and Constant-Degree Lossless Expanders [Extended Abstract] (2009) (0)
Erratum to: Theory of Cryptography (2009) (0)
Incremental Deterministic Public-Key Encryption (2017) (0)
Magic Functions In Memoriam (2014) (0)
L G ] 2 8 N ov 2 01 8 Fairness Through Computationally-Bounded Awareness (2018) (0)
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (2021) (0)
Efficiency Improvements in Constructing Pseudorandom Generators (2010) (0)
Leximax Approximations and Representative Cohort Selection (2022) (0)
Generative Models of Huge Objects (2023) (0)

This paper list is powered by the following services:

Other Resources About Omer Reingold

What Schools Are Affiliated With Omer Reingold?

Omer Reingold is affiliated with the following schools:

Omer Reingold's Academic­Influence.com Rankings