World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
60
Citations
17652
World Ranking
3197
National Ranking
1550

Research.com Recognitions

  • 2014 - ACM Fellow For contributions to the study of pseudorandomness, derandomization, and cryptography.
  • 2005 - ACM Grace Murray Hopper Award For his work in finding a deterministic logarithmic-space algorithm for ST-connectivity in undirected graphs.

Overview

Omer Reingold is affiliated with Stanford University in the United States. Their research contributions are primarily situated in the field of Computer Science, with a focus on subfields including Artificial Intelligence, Statistics and Probability, Computational Theory and Mathematics, Management Science and Operations Research, and Electrical and Electronic Engineering.

Their work spans multiple key topics such as:

  • Adversarial Robustness in Machine Learning
  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Privacy-Preserving Technologies in Data
  • Bayesian Modeling and Causal Inference
  • Statistical Methods and Inference
  • Advanced Bandit Algorithms Research

Omer Reingold's contributions have been published in various venues, with frequent appearances in:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Theory of Computing
  • Proceedings of the National Academy of Sciences
  • Proceedings of the AAAI Conference on Artificial Intelligence

Recent papers include:

  • "Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments" (2021, arXiv (Cornell University))
  • "Universal adaptability: Target-independent inference that competes with propensity scoring" (2022, Proceedings of the National Academy of Sciences)
  • "Dissenting Explanations: Leveraging Disagreement to Reduce Model Overreliance" (2024, Proceedings of the AAAI Conference on Artificial Intelligence)
  • "Bounded-Leakage Differential Privacy" (2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl))
  • Undisclosed title (2021, Theory of Computing)

Omer Reingold has collaborated extensively with a number of coauthors. Their frequent coauthors include:

  • Salil Vadhan
  • Iftach Haitner
  • Charlotte Peale
  • Parikshit Gopalan
  • Lunjia Hu

Their work encompasses developments in theoretical computer science and machine learning, often intersecting with studies on pseudorandomness, derandomization, privacy, and robust algorithms.

Recognition for their contributions includes the ACM Fellow award received in 2014, awarded for work on pseudorandomness, derandomization, and cryptography. Earlier in their career, they were honored with the ACM Grace Murray Hopper Award in 2005 for discovering a deterministic logarithmic-space algorithm for ST-connectivity in undirected graphs.

Best Publications

  • Fairness through awareness

    Cynthia Dwork;Moritz Hardt;Toniann Pitassi;Omer Reingold

  • Undirected connectivity in log-space

    Omer Reingold

  • Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors

    Omer Reingold;Salil P. Vadhan;Avi Wigderson

  • Priced Oblivious Transfer: How to Sell Digital Goods

    William Aiello;Yuval Ishai;Omer Reingold

  • Keyword search and oblivious pseudorandom functions

    Michael J. Freedman;Yuval Ishai;Benny Pinkas;Omer Reingold

  • On the Construction of Pseudorandom Permutations: Luby--Rackoff Revisited

    Moni Naor;Omer Reingold

  • Number-theoretic constructions of efficient pseudo-random functions

    M. Naor;O. Reingold

  • On the complexity of differentially private data release: efficient algorithms and hardness results

    Cynthia Dwork;Moni Naor;Omer Reingold;Guy N. Rothblum

  • Number-theoretic constructions of efficient pseudo-random functions

    Moni Naor;Omer Reingold

  • Undirected ST-connectivity in log-space

    Omer Reingold

  • The reusable holdout: Preserving validity in adaptive data analysis

    Cynthia Dwork;Vitaly Feldman;Moritz Hardt;Toniann Pitassi

  • Preserving Statistical Validity in Adaptive Data Analysis

    Cynthia Dwork;Vitaly Feldman;Moritz Hardt;Toniann Pitassi

  • Entropy waves, the zig-zag graph product, and new constant-degree expanders

    Omer Reingold;Salil Vadhan;Avi Wigderson

  • Notions of Reducibility between Cryptographic Primitives

    Omer Reingold;Luca Trevisan;Salil P. Vadhan

  • Computational Differential Privacy

    Ilya Mironov;Omkant Pandey;Omer Reingold;Salil Vadhan

  • The Limits of Two-Party Differential Privacy.

    Andrew McGregor;Ilya Mironov;Toniann Pitassi;Omer Reingold

  • Extracting all the randomness and reducing the error in Trevisan's extractors

    Ran Raz;Omer Reingold;Salil Vadhan

  • Distributed Pseudo-random functions and KDCs

    Moni Naor;Benny Pinkas;Omer Reingold

  • Randomness conductors and constant-degree lossless expanders

    Michael Capalbo;Omer Reingold;Salil Vadhan;Avi Wigderson

  • Synthesizers and their application to the parallel construction of pseudo-random functions

    M. Naor;O. Reingold

  • Multicalibration: Calibration for the (Computationally-Identifiable) Masses

    Úrsula Hébert-Johnson;Michael P. Kim;Omer Reingold;Guy N. Rothblum

  • Number-Theoretic Constructions of Efficient Pseudo-Random Functions (Extended Abstract)

    Moni Naor;Omer Reingold

Frequent Co-Authors

Salil P. Vadhan
Salil P. Vadhan Harvard University
Moni Naor
Moni Naor Weizmann Institute of Science
Cynthia Dwork
Cynthia Dwork Harvard University
Guy N. Rothblum
Guy N. Rothblum Weizmann Institute of Science
Gil Segev
Gil Segev Hebrew University of Jerusalem
Luca Trevisan
Luca Trevisan Bocconi University
Alon Rosen
Alon Rosen Bocconi University
Toniann Pitassi
Toniann Pitassi Columbia University
Moritz Hardt
Moritz Hardt Max Planck Institute for Intelligent Systems
Avi Wigderson
Avi Wigderson Institute for Advanced Study

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA often opens doors to a wide range of career opportunities and related fields. Many students are now considering flexible learning options through online degrees, which offer both affordability and convenience.

For those interested in safeguarding digital infrastructure, cybersecurity online degrees provide a pathway to this high-demand sector. This specialization is perfect for students keen on protecting data and combating cyber threats.

Similarly, engineering-minded students may want to look into a master of construction management. These programs blend technical skills with leadership training, preparing graduates for roles in overseeing large-scale construction projects.

Another option is a criminal justice degree online cost comparison. This field intersects with technology in areas like forensic analysis and cybersecurity law, creating unique interdisciplinary opportunities.

For those drawn to finance and analytics, the best online accounting degree choices offer robust preparation for careers in auditing, corporate finance, and data analysis.

All these online programs allow computer science students to diversify their skills and expand their career pathways without sacrificing flexibility or affordability.

Best Scientists Citing Omer Reingold

Trending Scientists