Oded Goldreich
机构: Professor of Computer Science, Weizmann Institute of Science
每年引用次数
引用次数
引用: 67,123
H-指数: 99
I10-指数 : 222
出版物: 559
Universal Locally Testable Codes.
Oded Goldreich , Tom Gur
Electronic Colloquium on Computational Complexity 23 42
2
2016
Reducing testing affine spaces to testing linearity.
Oded Goldreich
Electronic Colloquium on Computational Complexity 23 80
2016
Notes for the first lecture in a course on Property Testing
Oded Goldreich
2016
Overview of the doubly-efficient interactive proof systems of RRR.
Oded Goldreich
Electron. Colloquium Comput. Complex. 24 102
2017
Introduction to Property Testing
Oded Goldreich
131
2017
Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets.
Oded Goldreich , Guy N. Rothblum
ITCS
4
2018
On Post-Modern Cryptography.
Oded Goldreich
IACR Cryptology ePrint Archive 2006 461
13
2006
Every Set in P Is Strongly Testable Under a Suitable Encoding.
Oded Goldreich , Tom Gur , Irit Dinur
ITCS
1
2019
Multi-pseudodeterministic algorithms.
Oded Goldreich
Electron. Colloquium Comput. Complex. 26 12
2
2019
The Random Oracle Methodology, Revisited
Oded Goldreich , Ran Canetti , Shai Halevi
arXiv: Cryptography and Security
2,246
2000
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof.
Oded Goldreich , Alfredo De Santis , Giuseppe Persiano , Giovanni Di Crescenzo
IACR Cryptology ePrint Archive 1996 14
1996
The GGM Construction does NOT yield Correlation Intractable Function Ensembles.
Oded Goldreich
IACR Cryptology ePrint Archive 2002 110
2002
Testing Isomorphism in the Bounded-Degree Graph Model.
Oded Goldreich
Electron. Colloquium Comput. Complex. 26 102
3
2019
Providing Sound Foundations for Cryptography: On the work of Shafi Goldwasser and Silvio Micali
Oded Goldreich
11
2019
A brief introduction to property testing
Oded Goldreich
Studies in complexity and cryptography 465 -469
12
2011
On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing.
Oded Goldreich
Computational Complexity and Property Testing 87 -118
1
2020
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions.
Avi Wigderson , Oded Goldreich
Computational Complexity and Property Testing 41 -86
1
2020
On the Effect of the Proximity Parameter on Property Testers.
Oded Goldreich
Computational Complexity and Property Testing 36 -40
2020
On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions.
Oded Goldreich , Avishay Tal
Computational Complexity and Property Testing 306 -325
2020
Pseudo-mixing Time of Random Walks.
Oded Goldreich , Itai Benjamini
Computational Complexity and Property Testing 363 -373
2020