☰

Oded Goldreich

Affiliations: 
2004 Weizmann Institute of Science, Rehovot, Israel 
Google:
"Oded Goldreich"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Shimon Even grad student Technion

Children

Sign in to add trainee
Ran Canetti grad student Weizmann Institute
Hugo Krawczyk grad student Weizmann Institute
Yehuda Lindell grad student Weizmann Institute
Alon Rosen grad student Weizmann Institute
Boaz Barak grad student 2004 Weizmann Institute
Or S. Meir grad student 2010 Weizmann Institute

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Goldreich O, Gur T, Komargodski I. (2019) Strong Locally Testable Codes with Relaxed Local Decoders Acm Transactions On Computation Theory. 11: 17
Goldreich O. (2019) Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity Computational Complexity. 28: 709-747
Goldreich O, Gur T, Rothblum RD. (2018) Proofs of proximity for context-free languages and read-once branching programs Information & Computation. 261: 175-201
Goldreich O, Ron D. (2016) On Sample-Based Testers Acm Transactions On Computation Theory. 8: 7
Goldreich O, Meir O. (2015) Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly Acm Transactions On Computation Theory. 7: 16
Czumaj A, Goldreich O, Ron D, et al. (2014) Finding cycles and trees in sublinear time Random Structures and Algorithms. 45: 139-184
Freeman DM, Goldreich O, Kiltz E, et al. (2013) More constructions of lossy and correlation-secure trapdoor functions Journal of Cryptology. 26: 39-74
Goldreich O, Izsak R. (2012) Monotone Circuits: One-Way Functions versus Pseudorandom Generators Theory of Computing. 8: 231-238
Goldreich O, Meir O. (2012) The tensor product of two good codes is not necessarily robustly testable Information Processing Letters. 112: 351-355
Goldreich O, Vadhan S. (2012) Special issue from RANDOM’09: Editors’ Foreword Computational Complexity. 21: 1-1
See more...