The following papers can be obtained in Postscript or PDF

- I. Benjamini and O. Goldreich, Pseudo-Mixing Time of Random Walks June 2019.
- I. Dinur, O. Goldreich, and T. Gur, Every set in P is strongly testable under a suitable encoding, Mar 2018.
- O. Goldreich, The uniform distribution is complete with respect to testing identity to a fixed distribution, Feb. 2016.
- O. Goldreich, Reducing testing affine spaces to testing linearity, May 2016.
- O. Goldreich, Deconstructing 1-local expanders, Sept 2016.
- O. Goldreich, On the doubly-efficient interactive proof systems of GKR, June 2017.
- O. Goldreich, Overview of the doubly-efficient interactive proof systems of RRR, June 2017.
- O. Goldreich, Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity, May 2018.
- O. Goldreich, Flexible models for testing graph properties, May 2018.
- O. Goldreich, Testing Graphs in Vertex-Distribution-Free Models , Oct. 2018.
- O. Goldreich, Multi-pseudodeterministic algorithms, Jan. 2019.
- O. Goldreich, Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model, May 2019.
- O. Goldreich, On the Complexity of Estimating the Effective Support Size, June 2019.
- O. Goldreich, Testing Isomorphism in the Bounded-Degree Graph Model, August 2019.
- O. Goldreich and T. Gur, Universal Locally Testable Codes, Mar. 2016.
- O. Goldreich and T. Gur, Universal Locally Verifiable Codes and $3$-Round Interactive Proofs of Proximity for CSP, Nov. 2016.
- O. Goldreich, T. Gur, and R. Rothblum, Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs, Feb. 2015.
- O. Goldreich and M. Leshkowitz, On Emulating Interactive Proofs with Public Coins, Apr. 2016.
- O. Goldreich and D. Ron, The Subgraph Testing Model, Mar. 2018.
- O. Goldreich and G. Rothblum, Simple doubly-efficient interactive proof systems for locally-characterizable sets , Feb. 2017.
- O. Goldreich and G. Rothblum, Worst-case to Average-case reductions for subclasses of P, Aug. 2017.
- O. Goldreich and G. Rothblum, Counting $t$-cliques: Worst-case to average-case reductions and Direct interactive proof systems, Mar. 2018.
- O. Goldreich and G. Rothblum, Constant-round interactive proof systems for AC0[2] and NC1, Apr. 2018.
- O. Goldreich and A. Tal, Matrix Rigidity of Random Toeplitz Matrices, May 2015.
- O. Goldreich and A. Tal, On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions, Dec 2017.
- O. Goldreich, E. Viola, and A. Wigderson, On Randomness Extraction in AC0, January 2015.

Back to Oded Goldreich's homepage or to General list of Oded Goldreich's papers