2012
46Finding 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
45On 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
44Finding 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
43Universal Arguments and their Applications. Boaz Barak, Oded Goldreich. SIAM J. Comput. (38): 1661-1694 (2008). Web SearchBibTeXDownload
2006
42Lower 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
41Session-Key Generation Using Human Passwords Only. Oded Goldreich, Yehuda Lindell. J. Cryptology (19): 241-340 (2006). Web SearchBibTeXDownload
2003
40Almost k-wise independence versus k-wise independence. Noga Alon, Oded Goldreich, Yishay Mansour. Inf. Process. Lett. (88): 107-110 (2003). Web SearchBibTeXDownload
2002
39Almost k-wise independence versus k-wise independence. Noga Alon, Oded Goldreich, Yishay Mansour. Electronic Colloquium on Computational Complexity (ECCC) 2002. Web SearchBibTeXDownload
38On Chosen Ciphertext Security of Multiple Encryptions. Oded Goldreich, Yoad Lustig, Moni Naor. IACR Cryptology ePrint Archive (2002): 89 (2002). Web SearchBibTeXDownload
37Universal Arguments and their Applications. Boaz Barak, Oded Goldreich. IEEE Conference on Computational Complexity 2002, 194-203. Web SearchBibTeXDownload
36Lower 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
35On 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
34Session-Key Generation Using Human Passwords Only. Oded Goldreich, Yehuda Lindell. CRYPTO 2001, 408-432. Web SearchBibTeXDownload
33Lower 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
32Universal Arguments and their Applications. Boaz Barak, Oded Goldreich. Electronic Colloquium on Computational Complexity (ECCC) 2001. Web SearchBibTeXDownload
31Resettably-Sound Zero-Knowledge and its Applications. Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell. FOCS 2001, 116-125. Web SearchBibTeXDownload
2000
30Session-Key Generation using Human Passwords Only. Oded Goldreich, Yehuda Lindell. IACR Cryptology ePrint Archive (2000): 57 (2000). Web SearchBibTeXDownload
29Learning Polynomials with Queries: The Highly Noisy Case. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan. SIAM J. Discrete Math. (13): 535-570 (2000). Web SearchBibTeXDownload
1999
28Deterministic Amplification of Space-Bounded Probabilistic Algorithms. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson. IEEE Conference on Computational Complexity 1999, 188. Web SearchBibTeXDownload
1998
27Deterministic Amplification of Space Bounded Probabilistic Algorithms. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson. Electronic Colloquium on Computational Complexity (ECCC) (5) (1998). Web SearchBibTeXDownload
26Learning Polynomials with Queries - The Highly Noisy Case. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan. Electronic Colloquium on Computational Complexity (ECCC) (5) (1998). Web SearchBibTeXDownload
25Private Information Retrieval. Carlo Blundo, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan. J. ACM (45): 965-981 (1998). Web SearchBibTeXDownload
24Computational Complexity and Knowledge Complexity. Oded Goldreich, Rafail Ostrovsky, Erez Petrank. SIAM J. Comput. (27): 1116-1141 (1998). Web SearchBibTeXDownload
23Computational Indistinguishability: Algorithms vs. Circuits. Oded Goldreich, Bernd Meyer. Theor. Comput. Sci. (191): 215-218 (1998). Web SearchBibTeXDownload
1996
22Computational Indistinguishability - Algorithms vs. Circuits. Oded Goldreich. Electronic Colloquium on Computational Complexity (ECCC) (3) (1996). Web SearchBibTeXDownload
21Software Protection and Simulation on Oblivious RAMs. Oded Goldreich, Rafail Ostrovsky. J. ACM (43): 431-473 (1996). Web SearchBibTeXDownload
20The 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
19Adaptively Secure Multi-Party Computation. Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor. STOC 1996, 639-648. Web SearchBibTeXDownload
1995
18Learning Polynomials with Queries: The Highly Noisy Case. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan. FOCS 1995, 294-303. Web SearchBibTeXDownload
17Private Information Retrieval. Carlo Blundo, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan. FOCS 1995, 41-50. Web SearchBibTeXDownload
1994
16Computational Complexity and Knowledge Complexity. Oded Goldreich, Rafail Ostrovsky, Erez Petrank. Electronic Colloquium on Computational Complexity (ECCC) (1) (1994). Web SearchBibTeXDownload
15Computational complexity and knowledge complexity (extended abstract). Oded Goldreich, Rafail Ostrovsky, Erez Petrank. STOC 1994, 534-543. Web SearchBibTeXDownload
1993
14Addendum 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
13On 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
12On 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
11Simple 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
10On 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
9Efficient 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
8Simple Constructions of Almost k-Wise Independent Random Variables. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta. FOCS 1990, 544-553. Web SearchBibTeXDownload
1989
7On the Theory of Average Case Complexity. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby. STOC 1989, 204-216. Web SearchBibTeXDownload
6On 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
5Efficient 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
4Electing a Leader in a Ring with Link Failures. Oded Goldreich, Liuba Shrira. Acta Inf. (24): 79-91 (1987). Web SearchBibTeXDownload
3On 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
2The Effect of Link Failures on Computations in Asynchronous Rings. Oded Goldreich, Liuba Shrira. PODC 1986, 174-185. Web SearchBibTeXDownload
1984
1On the np-completeness of certain network testing problems. Shimon Even, Oded Goldreich, Shlomo Moran, Po Tong. Networks (14): 1-24 (1984). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research