Some Recent Papers by Oded Goldreich
last updated: Dec 2025
- N. Amir, O. Goldreich, and G. Rothblum.
Doubly Sub-linear Interactive Proofs of Proximity,
Sept 2024.
- N. Bshouty and O. Goldreich,
On properties that are non-trivial to test, Feb 2022.
- I. Dinur and O. Goldreich,
Expansion without Connectivity:
A Property Testing Perspective, Sept 2025.
- O. Goldreich, On the Lower Bound
on the Length of Relaxed Locally Decodable Codes, May 2023.
- O. Goldreich, On the complexity
of enumerating ordered sets, Sept. 2023.
- O. Goldreich, On coarse
and fine approximate counting of $t$-cliques, Sept. 2023.
- O. Goldreich, On the query complexity of
testing local graph properties in the bounded-degree graph model,
Mar. 2024.
- O. Goldreich, Solving Tree Evaluation
in $o(\log n \cdot \log\log n)$ space, July 2024.
- O. Goldreich,
On defining PPT-search problems, Oct. 2024.
- O. Goldreich,
Proving the PCP Theorem with 1.5 proof compositions
(or yet another PCP construction), Nov. 2025.
- O. Goldreich, T. Herman, and G. Rothblum,
Interactive proof systems for FARNESS,
Dec 2025.
- O. Goldreich and G. Rothblum,
Location-Invariant Properties of Functions
versus Properties of Distributions:
United in Testing but Separated in Verification, July 2025.
- O. Goldreich and G. Rothblum,
On doubly-sublinear interactive proofs
for distributions, Dec 2025.
- O. Goldreich, G. Rothblum, and T. Skverer,
On Interactive Proofs of Proximity
with Proof-Oblivious Queries , Sept 2022.
- O. Goldreich and L. Tauber,
Testing in the bounded-degree graph model
with degree bound two, Dec 2022.
- O. Goldreich and L. Tauber,
On Testing Isomorphism to a Fixed Graph
in the Bounded-Degree Graph Model, Sept 2023.
- O. Goldreich and L. Tauber,
On Testing Group Properties, Dec 2023.
- O. Goldreich and R. Tell,
Complexity theoretic implications
of pseudodeterministic algorithms for PPT-search problems, Feb 2025.
Back to Oded Goldreich's homepage
or to General list of Oded Goldreich's papers