Some Recent Papers by Oded Goldreich
last updated: Sept 2024
The following papers can be obtained in Postscript or PDF
- N. Amir, O. Goldreich, and G. Rothblum.
Doubly Sub-linear Interactive Proofs of Proximity,
Sept 2024.
- M. Ball, O. Goldreich, and T. Malkin, Randomness
Extraction from Somewhat Dependent Sources, Dec 2019.
- M. Ball, O. Goldreich, and T. Malkin, Communication
Complexity with Defective Randomness, April 2020.
- N. Bshouty and O. Goldreich,
On properties that are non-trivial to test, Feb 2022.
- I. Benjamini and O. Goldreich,
Pseudo-Mixing Time of Random Walks June 2019.
- 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, Improved bounds on
the AN-complexity of multilinear functions, Nov. 2019.
- O. Goldreich,
On Counting $t$-Cliques Mod 2, July 2020.
- O. Goldreich, On Testing Hamiltonicity
in the Bounded Degree Graph Model, July 2020.
- O. Goldreich, On Testing Asymmetry
in the Bounded Degree Graph Model, August 2020.
- O. Goldreich, Robust Self-Ordering
versus Local Self-Ordering, March 2021.
- 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 and D. Ron, One-Sided Error
Testing of Monomials and Affine Subspaces, May 2020.
- O. Goldreich and D. Ron, A Lower Bound
on the Complexity of Testing Grained Distributions, September 2021.
- O. Goldreich and D. Ron, Testing Distributions
of Huge Objects, September 2021.
- 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 A. Wigderson,
Robustly Self-Ordered Graphs:
Constructions and Applications to Property Testing, Sept 2020.
- O. Goldreich and A. Wigderson,
Non-adaptive vs Adaptive Queries
in the Dense Graph Testing Model, Nov 2020.
- O. Goldreich and A. Wigderson, Constructing
Large Families of Pairwise Far Permutations: Good
Permutation Codes Based on the Shuffle-Exchange Network, Dec 2020.
Back to Oded Goldreich's homepage
or to General list of Oded Goldreich's papers