Oded Goldreich
Computational Theory and Mathematics · 1985–2017
A researcher in the Science corpus: 26 papers; trusts 45 researchers and is trusted by 288 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 55 citations into it; #64 of 12,489 by trust here, #156 by citations
- Artificial Intelligence — 52 citations into it; #2,872 of 36,961 by trust here, #2,683 by citations
- Computer Networks and Communications — 30 citations into it; #36 of 9,996 by trust here, #50 by citations
- Privacy & Security — 19 citations into it; #14 of 710 by trust here, #42 by citations
- Algorithms & Complexity — 15 citations into it
- Statistics and Probability — 10 citations into it; #1,247 of 13,188 by trust here, #2,867 by citations
- Information Theory — 7 citations into it
- Statistical Learning Theory — 7 citations into it
Whom Oded Goldreich trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Shafi Goldwasser
- Silvio Micali
- Dana Ron
- Adi Shamir
- Subhash Khot
- Tuğkan Batu
- Liam Paninski
- Lance Fortnow
- Irit Dinur
- Leslie G. Valiant
Who trusts Oded Goldreich overall
- Yehuda Lindell
- Jayadev Acharya
- Benny Pinkas
- Mihir Bellare
- Emil Stefanov
- Clément Louis Canonne
- Vladimir Kolesnikov
- Dan Boneh
- Moni Naor
- David E. Evans
Papers from Oded Goldreich's perspective
Ordered by how strongly the researchers Oded Goldreich trusts endorse each paper. Same corpus, a different order for every researcher.
- Information Theory: 1948-1998 - Guest Editorial
- IP = PSPACE
- Property testing and its connection to learning and approximation
- New Directions in Cryptography
- Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities
- On Testing Expansion in Bounded-Degree Graphs
- A theory of the learnable
- Probabilistic Encryption
- The random oracle methodology, revisited (JACM)
- Some optimal inapproximability results
Their papers
- Foundations of Cryptography: Volume 1, Basic Tools (2001) — 2,159 citations
- On the (im)possibility of obfuscating programs (2001) — 1,515 citations
- Private information retrieval (1995)
- On interactive proofs with a laconic prover (2001) — 124 citations
- Robust pcps of proximity, shorter pcps and applications to coding (2004) — 339 citations
- Short PCPs verifiable in polylogarithmic time (2005) — 118 citations
- How to play ANY mental game (1987)
- On Testing Expansion in Bounded-Degree Graphs (2000) — 348 citations
- The uniform distribution is complete with respect to testing identity to a fixed distribution (2016) — 73 citations
- Property Testing in Bounded Degree Graphs (2002) — 390 citations
- Introduction to Property Testing (2017) — 397 citations
- The Foundations of Cryptography - Volume 1: Basic Techniques (2001) — 810 citations
- On Multiple Input Problems in Property Testing (2013) — 15 citations
- Computational complexity: a conceptual perspective (2008) — 600 citations
- Foundations of Cryptography: Volume 1 (2006) — 605 citations
- Foundations of Cryptography: Basic Tools (2000) — 695 citations
- The random oracle methodology, revisited (2000) — 1,392 citations
- Modern Cryptography, Probabilistic Proofs and Pseudorandomness (1998)
- On the Complexity of Interactive Proofs with Bounded Communication (1998)
- Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing (1997)