| 2012 |
|---|
| 46 | Finding Cycles and Trees in Sublinear Time. Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler. Electronic Colloquium on Computational Complexity (ECCC) (19): 35 (2012). Web SearchBibTeXDownload |
| 45 | On the (im)possibility of obfuscating programs. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang. J. ACM (59): 6 (2012). Web SearchBibTeXDownload |
| 2010 |
|---|
| 44 | Finding Cycles and Trees in Sublinear Time. Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler. CoRR (abs/1007.4230) (2010). Web SearchBibTeXDownload |
| 2008 |
|---|
| 43 | Universal Arguments and their Applications. Boaz Barak, Oded Goldreich. SIAM J. Comput. (38): 1661-1694 (2008). Web SearchBibTeXDownload |
| 2006 |
|---|
| 42 | Lower bounds for linear locally decodable codes and private information retrieval. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan. Computational Complexity (15): 263-296 (2006). Web SearchBibTeXDownload |
| 41 | Session-Key Generation Using Human Passwords Only. Oded Goldreich, Yehuda Lindell. J. Cryptology (19): 241-340 (2006). Web SearchBibTeXDownload |
| 2003 |
|---|
| 40 | Almost k-wise independence versus k-wise independence. Noga Alon, Oded Goldreich, Yishay Mansour. Inf. Process. Lett. (88): 107-110 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 39 | Almost k-wise independence versus k-wise independence. Noga Alon, Oded Goldreich, Yishay Mansour. Electronic Colloquium on Computational Complexity (ECCC) 2002. Web SearchBibTeXDownload |
| 38 | On Chosen Ciphertext Security of Multiple Encryptions. Oded Goldreich, Yoad Lustig, Moni Naor. IACR Cryptology ePrint Archive (2002): 89 (2002). Web SearchBibTeXDownload |
| 37 | Universal Arguments and their Applications. Boaz Barak, Oded Goldreich. IEEE Conference on Computational Complexity 2002, 194-203. Web SearchBibTeXDownload |
| 36 | Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan. IEEE Conference on Computational Complexity 2002, 175-183. Web SearchBibTeXDownload |
| 2001 |
|---|
| 35 | On the (Im)possibility of Obfuscating Programs. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang. CRYPTO 2001, 1-18. Web SearchBibTeXDownload |
| 34 | Session-Key Generation Using Human Passwords Only. Oded Goldreich, Yehuda Lindell. CRYPTO 2001, 408-432. Web SearchBibTeXDownload |
| 33 | Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan. Electronic Colloquium on Computational Complexity (ECCC) 2001. Web SearchBibTeXDownload |
| 32 | Universal Arguments and their Applications. Boaz Barak, Oded Goldreich. Electronic Colloquium on Computational Complexity (ECCC) 2001. Web SearchBibTeXDownload |
| 31 | Resettably-Sound Zero-Knowledge and its Applications. Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell. FOCS 2001, 116-125. Web SearchBibTeXDownload |
| 2000 |
|---|
| 30 | Session-Key Generation using Human Passwords Only. Oded Goldreich, Yehuda Lindell. IACR Cryptology ePrint Archive (2000): 57 (2000). Web SearchBibTeXDownload |
| 29 | Learning Polynomials with Queries: The Highly Noisy Case. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan. SIAM J. Discrete Math. (13): 535-570 (2000). Web SearchBibTeXDownload |
| 1999 |
|---|
| 28 | Deterministic Amplification of Space-Bounded Probabilistic Algorithms. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson. IEEE Conference on Computational Complexity 1999, 188. Web SearchBibTeXDownload |
| 1998 |
|---|
| 27 | Deterministic Amplification of Space Bounded Probabilistic Algorithms. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson. Electronic Colloquium on Computational Complexity (ECCC) (5) (1998). Web SearchBibTeXDownload |
| 26 | Learning Polynomials with Queries - The Highly Noisy Case. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan. Electronic Colloquium on Computational Complexity (ECCC) (5) (1998). Web SearchBibTeXDownload |
| 25 | Private Information Retrieval. Carlo Blundo, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan. J. ACM (45): 965-981 (1998). Web SearchBibTeXDownload |
| 24 | Computational Complexity and Knowledge Complexity. Oded Goldreich, Rafail Ostrovsky, Erez Petrank. SIAM J. Comput. (27): 1116-1141 (1998). Web SearchBibTeXDownload |
| 23 | Computational Indistinguishability: Algorithms vs. Circuits. Oded Goldreich, Bernd Meyer. Theor. Comput. Sci. (191): 215-218 (1998). Web SearchBibTeXDownload |
| 1996 |
|---|
| 22 | Computational Indistinguishability - Algorithms vs. Circuits. Oded Goldreich. Electronic Colloquium on Computational Complexity (ECCC) (3) (1996). Web SearchBibTeXDownload |
| 21 | Software Protection and Simulation on Oblivious RAMs. Oded Goldreich, Rafail Ostrovsky. J. ACM (43): 431-473 (1996). Web SearchBibTeXDownload |
| 20 | The future of computational complexity theory: part I. Christos H. Papadimitriou, Oded Goldreich, Avi Wigderson, Alexander A. Razborov, Michael Sipser. SIGACT News (27): 6-12 (1996). Web SearchBibTeXDownload |
| 19 | Adaptively Secure Multi-Party Computation. Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor. STOC 1996, 639-648. Web SearchBibTeXDownload |
| 1995 |
|---|
| 18 | Learning Polynomials with Queries: The Highly Noisy Case. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan. FOCS 1995, 294-303. Web SearchBibTeXDownload |
| 17 | Private Information Retrieval. Carlo Blundo, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan. FOCS 1995, 41-50. Web SearchBibTeXDownload |
| 1994 |
|---|
| 16 | Computational Complexity and Knowledge Complexity. Oded Goldreich, Rafail Ostrovsky, Erez Petrank. Electronic Colloquium on Computational Complexity (ECCC) (1) (1994). Web SearchBibTeXDownload |
| 15 | Computational complexity and knowledge complexity (extended abstract). Oded Goldreich, Rafail Ostrovsky, Erez Petrank. STOC 1994, 534-543. Web SearchBibTeXDownload |
| 1993 |
|---|
| 14 | Addendum to "Simple Construction of Almost k-wise Independent Random Variables". Noga Alon, Oded Goldreich, Johan Håstad, René Peralta. Random Struct. Algorithms (4): 119-120 (1993). Web SearchBibTeXDownload |
| 1992 |
|---|
| 13 | On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. Reuven Bar-Yehuda, Oded Goldreich, Alon Itai. J. Comput. Syst. Sci. (45): 104-126 (1992). Web SearchBibTeXDownload |
| 12 | On the Theory of Average Case Complexity. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby. J. Comput. Syst. Sci. (44): 193-219 (1992). Web SearchBibTeXDownload |
| 11 | Simple Construction of Almost k-wise Independent Random Variables. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta. Random Struct. Algorithms (3): 289-304 (1992). Web SearchBibTeXDownload |
| 1991 |
|---|
| 10 | On the Complexity of Computation in the Presence of Link Failures: The Case of a Ring. Oded Goldreich, Liuba Shrira. Distributed Computing (5): 121-131 (1991). Web SearchBibTeXDownload |
| 9 | Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. Reuven Bar-Yehuda, Oded Goldreich, Alon Itai. Distributed Computing (5): 67-71 (1991). Web SearchBibTeXDownload |
| 1990 |
|---|
| 8 | Simple Constructions of Almost k-Wise Independent Random Variables. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta. FOCS 1990, 544-553. Web SearchBibTeXDownload |
| 1989 |
|---|
| 7 | On the Theory of Average Case Complexity. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby. STOC 1989, 204-216. Web SearchBibTeXDownload |
| 6 | On the Theory of Average Case Complexity (abstract). Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby. Structure in Complexity Theory Conference 1989, 36. Web SearchBibTeXDownload |
| 5 | Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. Reuven Bar-Yehuda, Oded Goldreich, Alon Itai. WDAG 1989, 24-32. Web SearchBibTeXDownload |
| 1987 |
|---|
| 4 | Electing a Leader in a Ring with Link Failures. Oded Goldreich, Liuba Shrira. Acta Inf. (24): 79-91 (1987). Web SearchBibTeXDownload |
| 3 | On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. Reuven Bar-Yehuda, Oded Goldreich, Alon Itai. PODC 1987, 98-108. Web SearchBibTeXDownload |
| 1986 |
|---|
| 2 | The Effect of Link Failures on Computations in Asynchronous Rings. Oded Goldreich, Liuba Shrira. PODC 1986, 174-185. Web SearchBibTeXDownload |
| 1984 |
|---|
| 1 | On the np-completeness of certain network testing problems. Shimon Even, Oded Goldreich, Shlomo Moran, Po Tong. Networks (14): 1-24 (1984). Web SearchBibTeXDownload |
