Brief Academic Profile. I am a Professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel."
Expert
About
Knuth Prize in 2017
Currently, his main research areas belong to the interplay of randomness and computation. Specific examples include:
The study of various notions of pseudorandomness.
The study of various types of probabilistic proof systems.
The study of property testing, a notion of approximation for decision problems
Paper list:
http://www.wisdom.weizmann.ac.il/~/oded/recent.html
https://scholar.google.com/citations?user=DLQW_LoAAAAJ
Interests
Google Presence
Oded Goldreich ("fancy" homepage)
my choices [Oded Goldreich]
my choices [Oded Goldreich, started 2009]. RSS feed. Go to the most recent choice. Preface. My impression is that STOC and FOCS do not function any more as ..."
Oded Goldreich | Blockchain People Database
For cryptocurrencies in particular, another great book is Bitcoin and . ... Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich (Information ..."
Redactable Blockchain - Cryptology ePrint Archive - IACR
overhead imposed by a redactable blockchain is small compared to the case of an immutable one. ...... Shimon Even, Oded Goldreich, and Silvio Micali."
O(1) Labs - Functional programming + crypto reading list
1 avr. 2018 - Oded Goldreich's Foundations of Cryptography is a classic, and it'll give ... For cryptocurrencies in particular, another great book is Bitcoin and ..."
Computational Complexity: A Conceptual Perspective 1, Oded Goldreich
Editorial Reviews. Review. "This interesting book... is refreshing to read his [Goldreichs'] .... Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction. Bitcoin and Cryptocurrency Technologies: A Comprehensive…"
Foundations of Cryptography by Oded Goldreich
Cambridge Core - Cryptography, Cryptology and Coding - Foundations of Cryptography - by Oded Goldreich."
User Oded Goldreich - Theoretical Computer Science Stack Exchange
I am a Professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel. My research interests lie ..."
Projects
Papers
2019
Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model
O Goldreich
arXiv preprint arXiv:1905.03070
0
2019
2019
0
2019
2019
0
2019
2019
Fractal/Multifractal modeling of geochemical data: A review
PL Gentili, PL Gentili, PL Gentili, PJ Steinbach, PL Gentili, PL Gentili, ...
Untangling Complex Systems: A Grand Challenge for Science 36 (8), xv-xvi
0
2019
2019
Strong Locally Testable Codes with Relaxed Local Decoders
O Goldreich, T Gur, I Komargodski
ACM Transactions on Computation Theory (TOCT) 11 (3), 17
0
2019
2019
Multi-pseudodeterministic algorithms
O Goldreich
0
2019
2018
2
2018
2018
Counting t-cliques: Worst-case to average-case reductions and Direct interactive proof systems
O Goldreich, G Rothblum
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 77-88
5
2018
2018
Proofs of proximity for context-free languages and read-once branching programs
O Goldreich, T Gur, RD Rothblum
Information and Computation 261, 175-201
15
2018
2018
Matrix rigidity of random toeplitz matrices
O Goldreich, A Tal
computational complexity 27 (2), 305-350
10
2018
2018
Flexible models for testing graph properties.
O Goldreich
Electronic Colloquium on Computational Complexity (ECCC) 25, 104
1
2018
2018
Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity.
O Goldreich
Electronic Colloquium on Computational Complexity (ECCC) 25, 98
1
2018
2018
On Doubly-Efficient Interactive Proof Systems
O Goldreich
Foundations and Trends® in Theoretical Computer Science 13 (3), 158-246
2
2018
2018
Every set in P is strongly testable under a suitable encoding
I Dinur, O Goldreich, T Gur
10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
4
2018
2018
The Subgraph Testing Model
O Goldreich, D Ron
10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
0
2018
2018
Simple doubly-efficient interactive proof systems for locally-characterizable sets
O Goldreich, GN Rothblum
9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
14
2018
2017
On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions.
O Goldreich, A Tal
Electronic Colloquium on Computational Complexity (ECCC) 24, 193
0
2017
2017
67
2017
2017
PODIUM: Procuring Opinions from Diverse Users in a Multi-Dimensional World
Y Amsterdamer, O Goldreich
Proceedings of the 2017 ACM on Conference on Information and Knowledge …
0
2017
2017
0
2017
Google Trends (past one year)
Academic Achievement
Popular People
Naval Ravikant
Entrepreneur | Investor @ AngelList | Bitwise Asset Management
Konstantinos (Kostas) Chalkias
Programmer @ R3
Craig Steven Wright
Programmer | Entrepreneur @ nChain | DeMorgan
Linda Xie
Investor | Entrepreneur @ Scalar Capital | Coinbase | 0x
Benedikt Bünz
Scholar @ Stanford University | Applied Crypto Group