How to Recycle Random Bits - Russell Impagliazzo; David Zuckerman (FOCS, 1989)

Security Preserving Amplification of Hardness - Oded Goldreich 001; Russell Impagliazzo; Leonid A. Levin; Ramarathnam Venkatesan; David Zuckerman (FOCS, 1990)

General Weak Random Sources - David Zuckerman (FOCS, 1990)

On the Time to Traverse all Edges of a Graph. - David Zuckerman (Inf. Process. Lett., 1991)

A Technique for Lower Bounding the Cover Time. - David Zuckerman (SIAM J. Discret. Math., 1992)

NP-Complete Problems Have a Version That's Hard to Approximate. - David Zuckerman (SCT, 1993)

More deterministic simulation in logspace. - Noam Nisan; David Zuckerman (STOC, 1993)

Optimal Speedup of Las Vegas Algorithms. - Michael Luby; Alistair Sinclair; David Zuckerman (Inf. Process. Lett., 1993)

Derandomized Graph Products. - Noga Alon; Uriel Feige; Avi Wigderson; David Zuckerman (Comput. Complex., 1995)

Randomness-Optimal Sampling, Extractors, and Constructive Leader Election. - David Zuckerman (STOC, 1996)

Simulating BPP Using a General Weak Random Source. - David Zuckerman (Algorithmica, 1996)

Randomness is Linear in Space. - Noam Nisan; David Zuckerman (J. Comput. Syst. Sci., 1996)

Multiple cover time. - Peter Winkler 001; David Zuckerman (Random Struct. Algorithms, 1996)

On Unapproximable Versions of NP-Complete Problems. - David Zuckerman (SIAM J. Comput., 1996)

Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). - Leonard J. Schulman; David Zuckerman (SODA, 1997)

Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. - Nathan Linial; Michael Luby; Michael E. Saks; David Zuckerman (Comb., 1997)

Another proof that BPP subseteq PH (and more). - Oded Goldreich 001; David Zuckerman (Electron. Colloquium Comput. Complex., 1997)

Randomness-optimal oblivious sampling. - David Zuckerman (Random Struct. Algorithms, 1997)

Perfect Information Leader Election in log*n + O(1) Rounds. - Alexander Russell; David Zuckerman (FOCS, 1998)

Extractors for Weak Random Sources and Their Applications. - David Zuckerman (SWAT, 1998)

Lower Bounds for Randomized Mutual Exclusion. - Eyal Kushilevitz; Yishay Mansour; Michael O. Rabin; David Zuckerman (SIAM J. Comput., 1998)

Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. - Avi Wigderson; David Zuckerman (Comb., 1999)

Tight Analyses of Two Local Load Balancing Algorithms. - Bhaskar Ghosh; Frank Thomson Leighton; Bruce M. Maggs; S. Muthukrishnan 001; C. Greg Plaxton; Rajmohan Rajaraman; Andréa W. Richa; Robert Endre Tarjan; David Zuckerman (SIAM J. Comput., 1999)

Computing with Very Weak Random Sources. - Aravind Srinivasan; David Zuckerman (SIAM J. Comput., 1999)

Asymptotically good codes correcting insertions, deletions, and transpositions. - Leonard J. Schulman; David Zuckerman (IEEE Trans. Inf. Theory, 1999)

Interaction in Quantum Communication Complexity - Ashwin Nayak 001; Amnon Ta-Shma; David Zuckerman (CoRR, 2000)

Low discrepancy sets yield approximate min-wise independent permutation families. - Michael E. Saks; Aravind Srinivasan; Shiyu Zhou; David Zuckerman (Inf. Process. Lett., 2000)

Interaction in quantum communication and the complexity of set disjointness. - Hartmut Klauck; Ashwin Nayak 001; Amnon Ta-Shma; David Zuckerman (STOC, 2001)

Loss-less condensers, unbalanced expanders, and extractors. - Amnon Ta-Shma; Christopher Umans; David Zuckerman (STOC, 2001)

Perfect Information Leader Election in log* n+O (1) Rounds. - Alexander Russell; David Zuckerman (J. Comput. Syst. Sci., 2001)

Expander Graphs for Digital Stream Authentication and Robust Overlay Networks. - Dawn Xiaodong Song; J. D. Tygar; David Zuckerman (S&P, 2002)

Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. - Alexander Russell; Michael E. Saks; David Zuckerman (SIAM J. Comput., 2002)

Combinatorial bounds for list decoding. - Venkatesan Guruswami; Johan Håstad; Madhu Sudan 001; David Zuckerman (IEEE Trans. Inf. Theory, 2002)

Extractor codes. - Amnon Ta-Shma; David Zuckerman (IEEE Trans. Inf. Theory, 2004)

Compression of Samplable Sources. - Luca Trevisan 001; Salil P. Vadhan; David Zuckerman (Comput. Complex., 2005)

Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number - David Zuckerman (Electron. Colloquium Comput. Complex., 2005)

Random Selection with an Adversarial Majority. - Ronen Gradwohl; Salil P. Vadhan; David Zuckerman (Electron. Colloquium Comput. Complex., 2006)

Extractors from Reed-Muller codes. - Amnon Ta-Shma; David Zuckerman; Shmuel Safra (J. Comput. Syst. Sci., 2006)

Lossless Condensers, Unbalanced Expanders, And Extractors. - Amnon Ta-Shma; Christopher Umans; David Zuckerman (Comb., 2007)

Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. - Jesse Kamp; David Zuckerman (SIAM J. Comput., 2007)

Interaction in Quantum Communication. - Hartmut Klauck; Ashwin Nayak 001; Amnon Ta-Shma; David Zuckerman (IEEE Trans. Inf. Theory, 2007)

Extractors for Three Uneven-Length Sources. - Anup Rao 001; David Zuckerman (APPROX-RANDOM, 2008)

Network Extractor Protocols. - Yael Tauman Kalai; Xin Li 006; Anup Rao 001; David Zuckerman (FOCS, 2008)

List-decoding reed-muller codes over small fields. - Parikshit Gopalan; Adam R. Klivans; David Zuckerman (STOC, 2008)

Small-Bias Spaces for Group Products. - Raghu Meka; David Zuckerman (APPROX-RANDOM, 2009)

Optimal testing of Reed-Muller codes. - Arnab Bhattacharyya 001; Swastik Kopparty; Grant Schoenebeck; Madhu Sudan 001; David Zuckerman (Electron. Colloquium Comput. Complex., 2009)

Testing low-degree polynomials over prime fields. - Charanjit S. Jutla; Anindya C. Patthak; Atri Rudra; David Zuckerman (Random Struct. Algorithms, 2009)

Optimal Testing of Reed-Muller Codes. - Arnab Bhattacharyya 001; Swastik Kopparty; Grant Schoenebeck; Madhu Sudan 001; David Zuckerman (Property Testing, 2010)

Can Random Coin Flips Speed Up a Computer? - David Zuckerman (CoRR, 2010)

Fooling functions of halfspaces under product distributions. - Yi Wu 002; Ryan O'Donnell; David Zuckerman; Parikshit Gopalan (Electron. Colloquium Comput. Complex., 2010)

Another Proof That BPP Í PH mathcal{BPP} subseteq mathcal{PH} (and More). - Oded Goldreich 001; David Zuckerman (Studies in Complexity and Cryptography, 2011)

Privacy Amplification and Non-malleable Extractors via Character Sums. - Yevgeniy Dodis; Xin Li 006; Trevor D. Wooley; David Zuckerman (FOCS, 2011)

Pseudorandom financial derivatives. - David Zuckerman (EC, 2011)

Non-malleable extractors via character sums - Trevor D. Wooley; David Zuckerman (CoRR, 2011)

Deterministic extractors for small-space sources. - Jesse Kamp; Anup Rao 001; Salil P. Vadhan; David Zuckerman (J. Comput. Syst. Sci., 2011)

Pseudorandomness from Shrinkage. - Russell Impagliazzo; Raghu Meka; David Zuckerman (Electron. Colloquium Comput. Complex., 2012)

Robust Pseudorandom Generators. - Yuval Ishai; Eyal Kushilevitz; Xin Li 006; Rafail Ostrovsky; Manoj Prabhakaran 001; Amit Sahai; David Zuckerman (Electron. Colloquium Comput. Complex., 2013)

Pseudorandom Generators for Combinatorial Shapes. - Parikshit Gopalan; Raghu Meka; Omer Reingold; David Zuckerman (SIAM J. Comput., 2013)

Pseudorandom Generators for Polynomial Threshold Functions. - Raghu Meka; David Zuckerman (SIAM J. Comput., 2013)

On Low Discrepancy Samplings in Product Spaces of Motion Groups. - Chandrajit L. Bajaj; Abhishek Bhowmick 001; Eshan Chattopadhyay; David Zuckerman (CoRR, 2014)

Deterministic Extractors for Additive Sources. - Abhishek Bhowmick 001; Ariel Gabizon; Thái Hoàng Lê; David Zuckerman (CoRR, 2014)

Non-Malleable Codes Against Constant Split-State Tampering. - Eshan Chattopadhyay; David Zuckerman (Electron. Colloquium Comput. Complex., 2014)

Privacy Amplification and Nonmalleable Extractors Via Character Sums. - Yevgeniy Dodis; Xin Li 006; Trevor D. Wooley; David Zuckerman (SIAM J. Comput., 2014)

Deterministic Extractors for Additive Sources: Extended Abstract. - Abhishek Bhowmick 001; Ariel Gabizon; Thái Hoàng Lê; David Zuckerman (ITCS, 2015)

Mining Circuit Lower Bound Proofs for Meta-Algorithms. - Ruiwen Chen; Valentine Kabanets; Antonina Kolokolova; Ronen Shaltiel; David Zuckerman (Comput. Complex., 2015)

Explicit Two-Source Extractors and Resilient Functions. - Eshan Chattopadhyay; David Zuckerman (Electron. Colloquium Comput. Complex., 2015)

New Extractors for Interleaved Sources. - Eshan Chattopadhyay; David Zuckerman (Electron. Colloquium Comput. Complex., 2015)

Robust Fourier and Polynomial Curve Fitting. - Venkatesan Guruswami; David Zuckerman (FOCS, 2016)

Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. - Zeev Dvir; David Zuckerman (Comput. Complex., 2016)

Bitcoin Beacon. - Iddo Bentov; Ariel Gabizon; David Zuckerman (CoRR, 2016)

Rectangles Are Nonnegative Juntas. - Mika Göös; Shachar Lovett; Raghu Meka; Thomas Watson 001; David Zuckerman (SIAM J. Comput., 2016)

Existence of Simple Extractors. - Xue Chen 001; David Zuckerman (Electron. Colloquium Comput. Complex., 2018)

Improved Extractors for Recognizable and Algebraic Sources. - Fu Li; David Zuckerman (Electron. Colloquium Comput. Complex., 2018)

XOR Lemmas for Resilient Functions Against Polynomials. - Eshan Chattopadhyay; Pooya Hatami; Kaave Hosseini; Shachar Lovett; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Nearly Optimal Pseudorandomness From Hardness. - Dean Doron; Dana Moshkovitz; Justin Oh; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. - Yuval Filmus; Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Certifiably Pseudorandom Financial Derivatives. - David Zuckerman (SIAM J. Comput., 2019)

Extractors and Secret Sharing Against Bounded Collusion Protocols. - Eshan Chattopadhyay; Jesse Goodman; Vipul Goyal; Ashutosh Kumar 002; Xin Li 006; Raghu Meka; David Zuckerman (FOCS, 2020)

Randomness Efficient Noise Stability and Generalized Small Bias Sets. - Dana Moshkovitz; Justin Oh; David Zuckerman (FSTTCS, 2020)

Spectral Sparsification via Bounded-Independence Sampling. - Dean Doron; Jack Murtagh; Salil P. Vadhan; David Zuckerman (Electron. Colloquium Comput. Complex., 2020)

Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. - Ashutosh Kumar 002; Raghu Meka; David Zuckerman (Electron. Colloquium Comput. Complex., 2020)

Simple Optimal Hitting Sets for Small-Success RL. - William M. Hoza; David Zuckerman (SIAM J. Comput., 2020)

The Space Complexity of Sampling. - Eshan Chattopadhyay; Jesse Goodman; David Zuckerman (Electron. Colloquium Comput. Complex., 2021)

Almost Chor-Goldreich Sources and Adversarial Random Walks. - Dean Doron; Dana Moshkovitz; Justin Oh; David Zuckerman (Electron. Colloquium Comput. Complex., 2022)

Extractors for Images of Varieties. - Zeyu Guo 001; Ben Lee Volk; Akhil Jalan; David Zuckerman (Electron. Colloquium Comput. Complex., 2022)

Online Condensing of Unpredictable Sources via Random Walks. - Dean Doron; Dana Moshkovitz; Justin Oh; David Zuckerman (Electron. Colloquium Comput. Complex., 2024)

Improved Condensers for Chor-Goldreich Sources. - Jesse Goodman; Xin Li 006; David Zuckerman (Electron. Colloquium Comput. Complex., 2024)

Near-Optimal Averaging Samplers. - Zhiyang Xun; David Zuckerman (Electron. Colloquium Comput. Complex., 2024)

Small-Space Spectral Sparsification via Bounded-Independence Sampling. - Dean Doron; Jack Murtagh; Salil P. Vadhan; David Zuckerman (ACM Trans. Comput. Theory, 2024)

Near-Optimal Averaging Samplers and Matrix Samplers. - Zhiyang Xun; David Zuckerman (CCC, 2025)

Linear Hashing Is Optimal. - Michael Jaber; Vinayak M. Kumar; David Zuckerman (Electron. Colloquium Comput. Complex., 2025)