What is he best known for?
The fields of study he is best known for:
- Algorithm
- Cryptography
- Algebra
His main research concerns Theoretical computer science, Discrete mathematics, Cryptography, Combinatorics and Mathematical proof.
His Theoretical computer science research is multidisciplinary, incorporating perspectives in Cryptographic protocol, Digital signature, Pseudorandom function family, Random oracle and Probabilistic logic.
His Discrete mathematics research incorporates elements of Randomness, String, Pseudorandom number generator and Triviality.
In the subject of general Cryptography, his work in Secure two-party computation is often linked to Seven Basic Tools of Quality, thereby combining diverse domains of study.
His work carried out in the field of Combinatorics brings together such families of science as Function and PCP theorem.
His research in Mathematical proof intersects with topics in Non-interactive zero-knowledge proof and Pseudorandomness.
His most cited work include:
- How to play ANY mental game (2707 citations)
- Foundations of Cryptography (1825 citations)
- How to construct random functions (1811 citations)
What are the main themes of his work throughout his whole career to date?
Oded Goldreich spends much of his time researching Discrete mathematics, Theoretical computer science, Combinatorics, Mathematical proof and Cryptography.
His biological study spans a wide range of topics, including Function, Pseudorandom number generator and Constant.
His research investigates the connection between Theoretical computer science and topics such as Time complexity that intersect with issues in Oracle.
His work on Upper and lower bounds expands to the thematically related Combinatorics.
Much of his study explores Mathematical proof relationship to Calculus.
His Cryptography study contributes to a more complete understanding of Computer security.
He most often published in these fields:
- Discrete mathematics (43.06%)
- Theoretical computer science (26.13%)
- Combinatorics (25.41%)
What were the highlights of his more recent work (between 2013-2021)?
- Discrete mathematics (43.06%)
- Combinatorics (25.41%)
- Property testing (10.45%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Discrete mathematics, Combinatorics, Property testing, Theoretical computer science and Mathematical proof.
His study in Discrete mathematics is interdisciplinary in nature, drawing from both Function, Multilinear functions and Constant.
His Function study incorporates themes from Computational complexity theory and Complexity class.
His Combinatorics research incorporates themes from Class and Upper and lower bounds.
His Property testing study combines topics from a wide range of disciplines, such as Context, Time complexity, Open problem, Property and Linear code.
His work in Theoretical computer science addresses subjects such as Simple, which are connected to disciplines such as Computational problem, Host and Algorithm.
Between 2013 and 2021, his most popular works were:
- How to play any mental game, or a completeness theorem for protocols with honest majority (331 citations)
- Introduction to Property Testing (130 citations)
- Finding cycles and trees in sublinear time (38 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Algebra
His main research concerns Combinatorics, Discrete mathematics, Property testing, Algorithm and Theoretical computer science.
The concepts of his Combinatorics study are interwoven with issues in Class and Block code.
His Gödel's completeness theorem study in the realm of Discrete mathematics connects with subjects such as Context-free language.
His Property testing research includes themes of Property, Graph property, Context and Time complexity.
The various areas that he examines in his Algorithm study include Simple, Fraction and Probabilistic analysis of algorithms.
His Theoretical computer science study combines topics in areas such as Cryptographic protocol and Mathematical proof.
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.
