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.
