| 2010 |
|---|
| 20 | Communication Complexity with Synchronized Clocks. Russell Impagliazzo, Ryan Williams. IEEE Conference on Computational Complexity 2010, 259-269. Web SearchBibTeXDownload |
| 2006 |
|---|
| 19 | Online Algorithms to Minimize Resource Reallocations and Network Communication. Sashka Davis, Jeff Edmonds, Russell Impagliazzo. APPROX-RANDOM 2006, 104-115. Web SearchBibTeXDownload |
| 18 | Infinitely-Often Universal Languages and Diagonalization. Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Web SearchBibTeXDownload |
| 17 | Extracting Randomness Using Few Independent Sources. Boaz Barak, Russell Impagliazzo, Avi Wigderson. SIAM J. Comput. (36): 1095-1118 (2006). Web SearchBibTeXDownload |
| 2004 |
|---|
| 16 | Extracting Randomness Using Few Independent Sources. Boaz Barak, Russell Impagliazzo, Avi Wigderson. FOCS 2004, 384-393. Web SearchBibTeXDownload |
| 2003 |
|---|
| 15 | Universal Languages and the Power of Diagonalization. Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel. IEEE Conference on Computational Complexity 2003, 337-346. Web SearchBibTeXDownload |
| 2001 |
|---|
| 14 | Communication complexity towards lower bounds on circuit depth. Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall. Computational Complexity (10): 210-246 (2001). Web SearchBibTeXDownload |
| 13 | 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 |
| 1998 |
|---|
| 12 | The Relative Complexity of NP Search Problems. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. J. Comput. Syst. Sci. (57): 3-19 (1998). Web SearchBibTeXDownload |
| 1997 |
|---|
| 11 | Does Parallel Repetition Lower the Error in Computationally Sound Protocols?. Mihir Bellare, Russell Impagliazzo, Moni Naor. FOCS 1997, 374-383. Web SearchBibTeXDownload |
| 1996 |
|---|
| 10 | Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski. J. Comput. Syst. Sci. (53): 104-111 (1996). Web SearchBibTeXDownload |
| 9 | Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Russell Impagliazzo, Moni Naor. J. Cryptology (9): 199-216 (1996). Web SearchBibTeXDownload |
| 8 | Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. Matthew Clegg, Jeff Edmonds, Russell Impagliazzo. STOC 1996, 174-183. Web SearchBibTeXDownload |
| 1995 |
|---|
| 7 | The relative complexity of NP search problems. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. STOC 1995, 303-314. Web SearchBibTeXDownload |
| 1993 |
|---|
| 6 | On Dice and Coins: Models of Computation for Random Generation. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir. Inf. Comput. (104): 159-174 (1993). Web SearchBibTeXDownload |
| 5 | Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski. STACS 1993, 386-397. Web SearchBibTeXDownload |
| 1991 |
|---|
| 4 | Communication Complexity Towards Lower Bounds on Circuit Depth. Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall. FOCS 1991, 249-257. Web SearchBibTeXDownload |
| 1989 |
|---|
| 3 | Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Russell Impagliazzo, Moni Naor. FOCS 1989, 236-241. Web SearchBibTeXDownload |
| 2 | Decision Versus Search Problems in Super-Polynomial Time. Russell Impagliazzo, Gábor Tardos. FOCS 1989, 222-227. Web SearchBibTeXDownload |
| 1 | On Dice and Coins: Models of Computation for Random Generation. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir. ICALP 1989, 319-340. Web SearchBibTeXDownload |
