Abstract is missing.
- A Probabilistic Error-Correcting Scheme that Provides Partial SecrecyScott E. Decatur, Oded Goldreich 0001, Dana Ron. 1-8 [doi]
- Bridging a Small Gap in the Gap Amplification of Assignment TestersOded Goldreich 0001, Or Meir. 9-16 [doi]
- On (Valiant's) Polynomial-Size Monotone Formula for MajorityOded Goldreich 0001. 17-23 [doi]
- Two Comments on Targeted Canonical DerandomizersOded Goldreich 0001. 24-35 [doi]
- On the Effect of the Proximity Parameter on Property TestersOded Goldreich 0001. 36-40 [doi]
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear FunctionsOded Goldreich 0001, Avi Wigderson. 41-86 [doi]
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property TestingOded Goldreich 0001. 87-118 [doi]
- Super-Perfect Zero-Knowledge ProofsOded Goldreich 0001, Liav Teichner. 119-140 [doi]
- On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition)Oded Goldreich 0001, Dana Ron. 141-151 [doi]
- The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed DistributionOded Goldreich 0001. 152-172 [doi]
- A Note on Tolerant Testing with One-Sided ErrorRoei Tell. 173-177 [doi]
- On Emulating Interactive Proofs with Public CoinsOded Goldreich 0001, Maya Leshkowitz. 178-198 [doi]
- Reducing Testing Affine Spaces to Testing Linearity of FunctionsOded Goldreich 0001. 199-219 [doi]
- Deconstructing 1-Local ExpandersOded Goldreich 0001. 220-248 [doi]
- Worst-Case to Average-Case Reductions for Subclasses of POded Goldreich 0001, Guy N. Rothblum. 249-295 [doi]
- On the Optimal Analysis of the Collision Probability Tester (an Exposition)Oded Goldreich 0001. 296-305 [doi]
- On Constant-Depth Canonical Boolean Circuits for Computing Multilinear FunctionsOded Goldreich 0001, Avishay Tal. 306-325 [doi]
- Constant-Round Interactive Proof Systems for AC0[2] and NC1Oded Goldreich 0001, Guy N. Rothblum. 326-351 [doi]
- Flexible Models for Testing Graph PropertiesOded Goldreich 0001. 352-362 [doi]
- Pseudo-mixing Time of Random WalksItai Benjamini, Oded Goldreich 0001. 363-373 [doi]
- On Constructing Expanders for Any Number of VerticesOded Goldreich 0001. 374-379 [doi]