| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Oded Goldreich, Or Meir |
The tensor product of two good codes is not necessarily robustly testable.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler |
Finding Cycles and Trees in Sublinear Time. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
On the Effect of the Proximity Parameter on Property Testers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
Two-Sided Error Proximity Oblivious Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
Invitation to complexity theory. |
ACM Crossroads |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Brendan Juba, Madhu Sudan |
A theory of goal-oriented communication. |
J. ACM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang |
On the (im)possibility of obfuscating programs. |
J. ACM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan |
Special issue from RANDOM'09: Editors' Foreword. |
Computational Complexity |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg |
Hierarchy Theorems for Property Testing. |
Computational Complexity |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
On struggle and competition in scientic fields. |
SIGACT News |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Two Comments on Targeted Canonical Derandomizers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Ron Rothblum |
Enhancements of Trapdoor Permutations. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan |
On the complexity of computational problems regarding distributions (a survey). |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Or Meir |
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Rani Izsak |
Monotone Circuits: One-Way Functions versus Pseudorandom Generators. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Proximity-Oblivious Testing. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich (eds.) |
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman |
|
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
A Sample of Samplers: A Computational Perspective on Sampling. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Madhu Sudan, Luca Trevisan |
From Logarithmic Advice to Single-Bit Advice. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Testing Expansion in Bounded-Degree Graphs. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Notes on Levin's Theory of Average-Case Complexity. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Candidate One-Way Functions Based on Expander Graphs. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Introduction to Testing Graph Properties. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Randomness and Computation. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Another Motivation for Reducing the Randomness Complexity of Algorithms. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihir Bellare, Oded Goldreich |
On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Short Locally Testable Codes and Proofs. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Noam Nisan, Avi Wigderson |
On Yao's XOR-Lemma. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan, Avi Wigderson |
Simplified Derandomization of BPP Using a Hitting Set Generator. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Strong Proofs of Knowledge. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
A Brief Introduction to Property Testing. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Three XOR-Lemmas - An Exposition. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Tali Kaufman |
Proximity Oblivious Testing and the Role of Invariances. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Shafi Goldwasser, Shai Halevi |
Collision-Free Hashing from Lattice Problems. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lidor Avigad, Oded Goldreich |
Testing Graph Blow-Up. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan |
On the Complexity of Computational Problems Regarding Distributions. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Contemplations on Testing Graph Properties. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Average Case Complexity, Revisited. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
On the Average-Case Complexity of Property Testing. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, David Zuckerman |
Another Proof That BPP Í PH\mathcal{BPP}\subseteq \mathcal{PH} (and More). |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
A Candidate Counterexample to the Easy Cylinders Conjecture. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Basic Facts about Expander Graphs. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvika Brakerski, Oded Goldreich |
From Absolute Distinguishability to Positive Distinguishability. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Bravely, Moderately: A Common Theme in Four Recent Works. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Leonid A. Levin, Noam Nisan |
On Constructing 1-1 One-Way Functions. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Avi Wigderson |
On the Circuit Complexity of Perfect Hashing. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
On Security Preserving Reductions - Revised Terminology. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihir Bellare, Oded Goldreich |
Proving Computational Ability. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
In a World of P=BPP. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Brendan Juba, Madhu Sudan |
A theory of goal-oriented communication. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Tali Kaufman |
Proximity Oblivious Testing and the Role of Invariances. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lidor Avigad, Oded Goldreich |
Testing Graph Blow-Up. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Introduction to Testing Graph Properties. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
In a World of P=BPP. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
On Testing Computability by Small Width OBDDs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Tali Kaufman |
Proximity Oblivious Testing and the Role of Invariances. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Or Sheffet |
On The Randomness Complexity of Property Testing. |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. |
J. Cryptology |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler |
Finding Cycles and Trees in Sublinear Time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Shafi Goldwasser, Asaf Nussboim |
On the Implementation of Huge Random Objects. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
P, NP, and NP-Completeness: The Basics of Complexity Theory. |
|
2010 |
RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
The Program of the Mini-Workshop. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Short Locally Testable Codes and Proofs: A Survey in Two Parts. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Introduction to Testing Graph Properties. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich (eds.) |
Property Testing - Current Research and Surveys [outgrow of a workshop at the Institute for Computer Science (ITCS) at Tsinghua University, January 2010] |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
A Brief Introduction to Property Testing. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg |
Hierarchy Theorems for Property Testing. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev |
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. |
Public Key Cryptography |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
On Testing Computability by Small Width OBDDs. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz |
Erratum for: on basing one-way functions on NP-hardness. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Brendan Juba, Madhu Sudan |
A Theory of Goal-Oriented Communication. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
A Candidate Counterexample to the Easy Cylinders Conjecture. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zvika Brakerski, Oded Goldreich |
From absolute distinguishability to positive distinguishability. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev |
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
On our duties as scientists. |
SIGACT News |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg |
Hierarchy Theorems for Property Testing. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Monotone Graph Properties, Graph Blow-up, One-Sided vs Two-Sided Error, Adaptivity vs Non-adaptivity, Property Testing, Graph Properties |
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On proximity oblivious testing. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
graph propeties, property testing |
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Proximity Oblivious Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg |
Hierarchy Theorems for Property Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Approximating average parameters of graphs. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Probabilistic Proof Systems: A Primer. |
Foundations and Trends in Theoretical Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Preface to the Special Issue from Random'06. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Computational complexity: a conceptual perspective. |
SIGACT News |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Oded Goldreich |
Universal Arguments and their Applications. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
Computational complexity - a conceptual perspective. |
|
2008 |
RDF |
|
| 1 | Oded Goldreich, Or Meir |
The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich |
On the Average-Case Complexity of Property Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Or Sheffet |
On the randomness complexity of property testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan |
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich |
On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. |
TCC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Or Sheffet |
On the Randomness Complexity of Property Testing. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kfir Barhum, Oded Goldreich, Adi Shraibman |
On Approximating the Average Distance Between Points. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")