D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 49 Citations 11,107 94 World Ranking 2991 National Ranking 1579

Research.com Recognitions

Awards & Achievements

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

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Cryptography
  • Algebra

Omer Reingold focuses on Discrete mathematics, Theoretical computer science, Combinatorics, Cryptography and Oblivious transfer. His Discrete mathematics study integrates concerns from other disciplines, such as Entropy and Pseudorandom generator, Pseudorandom number generator, Pseudorandomness. The various areas that Omer Reingold examines in his Theoretical computer science study include Equivalence, Hash function and Rolling hash, Double hashing.

His study in the fields of Binary logarithm under the domain of Combinatorics overlaps with other disciplines such as Lattice graph and Graph power. Omer Reingold has included themes like Traitor tracing, Set, Data structure and Boundary in his Cryptography study. His Oblivious transfer research integrates issues from Private information retrieval and Encryption.

His most cited work include:

  • Fairness through awareness (1211 citations)
  • Undirected connectivity in log-space (432 citations)
  • Priced Oblivious Transfer: How to Sell Digital Goods (354 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of study are Discrete mathematics, Combinatorics, Pseudorandom number generator, Theoretical computer science and Cryptography. His research in Discrete mathematics intersects with topics in Mathematical proof, Computational complexity theory, Function, One-way function and Entropy. In the field of Combinatorics, his study on Binary logarithm overlaps with subjects such as Branching, Random walk and Undirected graph.

His Pseudorandom generator study in the realm of Pseudorandom number generator interacts with subjects such as Factoring. His Theoretical computer science study also includes fields such as

  • Hash function together with Upper and lower bounds,
  • Oblivious transfer that connect with fields like Private information retrieval and Cryptographic protocol. His studies examine the connections between Cryptography and genetics, as well as such issues in Random oracle, with regards to Communication complexity.

He most often published in these fields:

  • Discrete mathematics (43.09%)
  • Combinatorics (32.98%)
  • Pseudorandom number generator (23.94%)

What were the highlights of his more recent work (between 2015-2021)?

  • Combinatorics (32.98%)
  • Discrete mathematics (43.09%)
  • Theoretical computer science (23.94%)

In recent papers he was focusing on the following fields of study:

Omer Reingold mostly deals with Combinatorics, Discrete mathematics, Theoretical computer science, Branching and Hash function. His work on Randomized algorithm as part of general Combinatorics research is frequently linked to Laplace operator, bridging the gap between disciplines. He merges many fields, such as Discrete mathematics and Conditioning, in his writings.

The Theoretical computer science study which covers Oracle that intersects with Cryptographic protocol, Private information retrieval, Oblivious transfer, Reduction and Commitment scheme. His Hash function research is multidisciplinary, incorporating elements of Cryptographic primitive and Corollary. Pseudorandom number generator and Function are frequently intertwined in his study.

Between 2015 and 2021, his most popular works were:

  • Constant-round interactive proofs for delegating computation (73 citations)
  • Fairness Through Computationally-Bounded Awareness (51 citations)
  • Calibration for the (Computationally-Identifiable) Masses (46 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Algebra
  • Cryptography

The scientist’s investigation covers issues in Discrete mathematics, Bounded function, Combinatorics, Calibration and Similarity. Omer Reingold has researched Combinatorics in several fields, including Space, Monotonic function and Pseudorandomness. His research integrates issues of Binary logarithm, Randomized algorithm and Approximation algorithm in his study of Space.

His Pseudorandomness research is multidisciplinary, incorporating perspectives in Order, Binary decision diagram, Pseudorandom generator and Conjecture. His study in Calibration is interdisciplinary in nature, drawing from both Computational complexity theory, Measure and Class. His studies deal with areas such as Training set and Computation as well as Computational complexity theory.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Fairness through awareness

Cynthia Dwork;Moritz Hardt;Toniann Pitassi;Omer Reingold.
conference on innovations in theoretical computer science (2012)

1041 Citations

Undirected connectivity in log-space

Omer Reingold.
Journal of the ACM (2008)

872 Citations

Number-theoretic constructions of efficient pseudo-random functions

Moni Naor;Omer Reingold.
Journal of the ACM (2004)

702 Citations

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

Omer Reingold;Salil P. Vadhan;Avi Wigderson.
foundations of computer science (2000)

501 Citations

Priced Oblivious Transfer: How to Sell Digital Goods

William Aiello;Yuval Ishai;Omer Reingold.
theory and application of cryptographic techniques (2001)

476 Citations

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

Moni Naor;Omer Reingold.
Journal of Cryptology (1999)

464 Citations

Undirected ST-connectivity in log-space

Omer Reingold.
symposium on the theory of computing (2005)

391 Citations

Keyword search and oblivious pseudorandom functions

Michael J. Freedman;Yuval Ishai;Benny Pinkas;Omer Reingold.
theory of cryptography conference (2005)

380 Citations

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

Cynthia Dwork;Moni Naor;Omer Reingold;Guy N. Rothblum.
symposium on the theory of computing (2009)

323 Citations

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

Omer Reingold;Salil Vadhan;Avi Wigderson.
Annals of Mathematics (2002)

312 Citations

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

Contact us

Best Scientists Citing Omer Reingold

Salil P. Vadhan

Salil P. Vadhan

Harvard University

Publications: 70

Yuval Ishai

Yuval Ishai

Technion – Israel Institute of Technology

Publications: 68

Aaron Roth

Aaron Roth

University of Pennsylvania

Publications: 59

Amit Sahai

Amit Sahai

University of California, Los Angeles

Publications: 48

Andrzej Pelc

Andrzej Pelc

Université du Québec en Outaouais

Publications: 46

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 45

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 43

Mihir Bellare

Mihir Bellare

University of California, San Diego

Publications: 42

Yevgeniy Dodis

Yevgeniy Dodis

New York University

Publications: 41

Moni Naor

Moni Naor

Weizmann Institute of Science

Publications: 40

Ran Canetti

Ran Canetti

Boston University

Publications: 36

Yehuda Lindell

Yehuda Lindell

Bar-Ilan University

Publications: 35

Rafael Pass

Rafael Pass

Cornell University

Publications: 35

Avi Wigderson

Avi Wigderson

Institute for Advanced Study

Publications: 35

Benny Pinkas

Benny Pinkas

Bar-Ilan University

Publications: 34

Luca Trevisan

Luca Trevisan

Bocconi University

Publications: 34

Something went wrong. Please try again later.