| 2025 | STOC | Linear Hashing Is Optimal. | Michael Jaber, Vinayak M. Kumar, David Zuckerman |
| 2024 | FOCS | Improved Condensers for Chor-Goldreich Sources. | Jesse Goodman, Xin Li, David Zuckerman |
| 2023 | STOC | Almost Chor-Goldreich Sources and Adversarial Random Walks. | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
| 2023 | STOC | Extractors for Images of Varieties. | Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman |
| 2020 | FOCS | Extractors and Secret Sharing Against Bounded Collusion Protocols. | Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman |
| 2020 | FOCS | Nearly Optimal Pseudorandomness From Hardness. | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
| 2020 | ICALP | Spectral Sparsification via Bounded-Independence Sampling. | Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman |
| 2020 | STOC | XOR lemmas for resilient functions against polynomials. | Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman |
| 2019 | ICALP | Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. | Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman |
| 2018 | FOCS | Simple Optimal Hitting Sets for Small-Success RL. | William Hoza, David Zuckerman |
| 2016 | FOCS | Robust Fourier and Polynomial Curve Fitting. | Venkatesan Guruswami, David Zuckerman |
| 2016 | STOC | Explicit two-source extractors and resilient functions. | Eshan Chattopadhyay, David Zuckerman |
| 2015 | STOC | Rectangles Are Nonnegative Juntas. | Mika Gs, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman |
| 2014 | FOCS | Non-malleable Codes against Constant Split-State Tampering. | Eshan Chattopadhyay, David Zuckerman |
| 2013 | ICALP | Robust Pseudorandom Generators. | Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman |
| 2012 | FOCS | Pseudorandomness from Shrinkage. | Russell Impagliazzo, Raghu Meka, David Zuckerman |
| 2011 | FOCS | Privacy Amplification and Non-malleable Extractors via Character Sums. | Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman |
| 2011 | STOC | Pseudorandom generators for combinatorial shapes. | Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman |
| 2010 | FOCS | Optimal Testing of Reed-Muller Codes. | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
| 2010 | STOC | Pseudorandom generators for polynomial threshold functions. | Raghu Meka, David Zuckerman |
| 2008 | FOCS | Network Extractor Protocols. | Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman |
| 2008 | STOC | List-decoding reed-muller codes over small fields. | Parikshit Gopalan, Adam R. Klivans, David Zuckerman |
| 2006 | CRYPTO | Random Selection with an Adversarial Majority. | Ronen Gradwohl, Salil P. Vadhan, David Zuckerman |
| 2006 | STOC | Deterministic extractors for small-space sources. | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman |
| 2006 | STOC | Linear degree extractors and the inapproximability of max clique and chromatic number. | David Zuckerman |
| 2004 | FOCS | Testing Low-Degree Polynomials over Prime Fields. | Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman |
| 2003 | FOCS | Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. | Jesse Kamp, David Zuckerman |
| 2002 | SP | Expander Graphs for Digital Stream Authentication and Robust Overlay Networks. | Dawn Xiaodong Song, J. D. Tygar, David Zuckerman |
| 2001 | FOCS | Extractors from Reed-Muller Codes. | Amnon Ta-Shma, David Zuckerman, Shmuel Safra |
| 2001 | STOC | Interaction in quantum communication and the complexity of set disjointness. | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
| 2001 | STOC | Loss-less condensers, unbalanced expanders, and extractors. | Amnon Ta-Shma, Christopher Umans, David Zuckerman |
| 2001 | STOC | Extractor codes. | Amnon Ta-Shma, David Zuckerman |
| 1999 | STOC | Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. | Alexander Russell, Michael E. Saks, David Zuckerman |
| 1998 | FOCS | Perfect Information Leader Election in log* | Alexander Russell, David Zuckerman |
| 1997 | SODA | Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). | Leonard J. Schulman, David Zuckerman |
| 1996 | STOC | Randomness-Optimal Sampling, Extractors, and Constructive Leader Election. | David Zuckerman |
| 1995 | STOC | Tight analyses of two local load balancing algorithms. | Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andra W. Richa, Robert Endre Tarjan, David Zuckerman |
| 1994 | FOCS | Computing with Very Weak Random Sources | Aravind Srinivasan, David Zuckerman |
| 1993 | STOC | Lower bounds for randomized mutual exclusion. | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman |
| 1993 | STOC | Efficient construction of a small hitting set for combinatorial rectangles in high dimension. | Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman |
| 1993 | STOC | More deterministic simulation in logspace. | Noam Nisan, David Zuckerman |
| 1993 | STOC | Expanders that beat the eigenvalue bound: explicit construction and applications. | Avi Wigderson, David Zuckerman |
| 1991 | FOCS | Simulating BPP Using a General Weak Random Source | David Zuckerman |
| 1990 | FOCS | Security Preserving Amplification of Hardness | Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman |
| 1990 | FOCS | General Weak Random Sources | David Zuckerman |
| 1990 | STOC | A Technique for Lower Bounding the Cover Time | David Zuckerman |
| 1989 | FOCS | How to Recycle Random Bits | Russell Impagliazzo, David Zuckerman |