The following pages link to Oded Goldreich (Q178474):
Displayed 50 items.
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Another Motivation for Reducing the Randomness Complexity of Algorithms (Q3088202) (← links)
- Property testing and its connection to learning and approximation (Q3158518) (← links)
- Private information retrieval (Q3158526) (← links)
- Two-Sided Error Proximity Oblivious Testing (Q3167426) (← links)
- Resettable zero-knowledge (extended abstract) (Q3191990) (← links)
- DES-like functions can generate the alternating group (Q3323836) (← links)
- (Q3325625) (← links)
- (Q3413440) (← links)
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
- A trade-off between information and communication in broadcast protocols (Q3474265) (← links)
- Approximating average parameters of graphs (Q3514701) (← links)
- Foundations of Cryptography – A Primer (Q3522271) (← links)
- Probabilistic Proof Systems: A Primer (Q3530806) (← links)
- Locally testable codes and PCPs of almost-linear length (Q3546312) (← links)
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions (Q3562902) (← links)
- Concurrent zero-knowledge with timing, revisited (Q3579206) (← links)
- Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
- (Q3585016) (← links)
- (Q3588158) (← links)
- On Testing Computability by Small Width OBDDs (Q3588436) (← links)
- Approximating Average Parameters of Graphs (Q3595407) (← links)
- On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits (Q3596379) (← links)
- On Approximating the Average Distance Between Points (Q3603473) (← links)
- On the Randomness Complexity of Property Testing (Q3603490) (← links)
- Hierarchy Theorems for Property Testing (Q3638900) (← links)
- Universal Arguments and their Applications (Q3642859) (← links)
- Foundations of Cryptography (Q3655279) (← links)
- (Q3724235) (← links)
- (Q3729902) (← links)
- (Q3731512) (← links)
- (Q3743317) (← links)
- (Q3763584) (← links)
- (Q3775469) (← links)
- (Q3777937) (← links)
- (Q3787498) (← links)
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Q3787911) (← links)
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole (Q3787913) (← links)
- (Q3796744) (← links)
- (Q3816074) (← links)
- The minimum-length generator sequence problem is NP-hard (Q3920644) (← links)
- Sparse pseudorandom distributions (Q3990219) (← links)
- Simple Constructions of Almost k-wise Independent Random Variables (Q4014640) (← links)
- Addendum to “simple constructions of almost k-wise independent random variables” (Q4034713) (← links)
- (Q4038698) (← links)
- Computational Complexity and Knowledge Complexity (Q4210087) (← links)
- (Q4224925) (← links)
- (Q4228521) (← links)
- (Q4230365) (← links)
- (Q4231909) (← links)