David Zuckerman

156 papers A* 47A 10Journal 87Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Markov Chain Robustness. ITCS David Zuckerman
2025	A*	`conf`	Linear Hashing Is Optimal. STOC Michael Jaber, Vinayak M. Kumar, David Zuckerman
2025	J	`jnl`	Linear Hashing Is Optimal. CoRR Michael Jaber, Vinayak M. Kumar, David Zuckerman
2025	J	`jnl`	Linear Hashing Is Optimal. Electron. Colloquium Comput. Complex. Michael Jaber, Vinayak M. Kumar, David Zuckerman
2025	A	`conf`	Near-Optimal Averaging Samplers and Matrix Samplers. CCC Zhiyang Xun, David Zuckerman
2025	A	`conf`	Online Condensing of Unpredictable Sources via Random Walks. CCC Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2024	A*	`conf`	Improved Condensers for Chor-Goldreich Sources. FOCS Jesse Goodman, Xin Li, David Zuckerman
2024	J	`jnl`	Improved Condensers for Chor-Goldreich Sources. CoRR Jesse Goodman, Xin Li, David Zuckerman
2024	J	`jnl`	Improved Condensers for Chor-Goldreich Sources. Electron. Colloquium Comput. Complex. Jesse Goodman, Xin Li, David Zuckerman
2024	J	`jnl`	Near-Optimal Averaging Samplers and Matrix Samplers. CoRR Zhiyang Xun, David Zuckerman
2024	J	`jnl`	Near-Optimal Averaging Samplers. Electron. Colloquium Comput. Complex. Zhiyang Xun, David Zuckerman
2024	J	`jnl`	Online Condensing of Unpredictable Sources via Random Walks. Electron. Colloquium Comput. Complex. Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2024	J	`jnl`	Small-Space Spectral Sparsification via Bounded-Independence Sampling. ACM Trans. Comput. Theory Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2023	A*	`conf`	Almost Chor-Goldreich Sources and Adversarial Random Walks. STOC Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2023	A*	`conf`	Extractors for Images of Varieties. STOC Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
2022	J	`jnl`	Almost Chor-Goldreich Sources and Adversarial Random Walks. Electron. Colloquium Comput. Complex. Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2022	J	`jnl`	Extractors for Images of Varieties. CoRR Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
2022	J	`jnl`	Extractors for Images of Varieties. Electron. Colloquium Comput. Complex. Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
2022	J	`jnl`	Nearly Optimal Pseudorandomness from Hardness. J. ACM Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2022	A	`conf`	The Space Complexity of Sampling. ITCS Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
2021	J	`jnl`	The Space Complexity of Sampling. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
2020	J	`jnl`	Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. Electron. Colloquium Comput. Complex. Ashutosh Kumar, Raghu Meka, David Zuckerman
2020	J	`jnl`	Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. Ashutosh Kumar, Raghu Meka, David Zuckerman
2020	A*	`conf`	Extractors and Secret Sharing Against Bounded Collusion Protocols. FOCS Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman
2020	A*	`conf`	Nearly Optimal Pseudorandomness From Hardness. FOCS Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2020	—	`conf`	Randomness Efficient Noise Stability and Generalized Small Bias Sets. FSTTCS Dana Moshkovitz, Justin Oh, David Zuckerman
2020	J	`jnl`	Simple Optimal Hitting Sets for Small-Success RL. SIAM J. Comput. William M. Hoza, David Zuckerman
2020	A*	`conf`	Spectral Sparsification via Bounded-Independence Sampling. ICALP Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2020	J	`jnl`	Spectral Sparsification via Bounded-Independence Sampling. CoRR Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2020	J	`jnl`	Spectral Sparsification via Bounded-Independence Sampling. Electron. Colloquium Comput. Complex. Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2020	A*	`conf`	XOR lemmas for resilient functions against polynomials. STOC Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
2019	A*	`ed.`	60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019 FOCS David Zuckerman
2019	A*	`conf`	Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. ICALP Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2019	J	`jnl`	Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. CoRR Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2019	J	`jnl`	Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Electron. Colloquium Comput. Complex. Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2019	J	`jnl`	Certifiably Pseudorandom Financial Derivatives. SIAM J. Comput. David Zuckerman
2019	—	`conf`	Improved Extractors for Recognizable and Algebraic Sources. APPROX-RANDOM Fu Li, David Zuckerman
2019	J	`jnl`	Nearly Optimal Pseudorandomness From Hardness. Electron. Colloquium Comput. Complex. Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2019	J	`jnl`	Pseudorandomness from Shrinkage. J. ACM Russell Impagliazzo, Raghu Meka, David Zuckerman
2019	J	`jnl`	XOR Lemmas for Resilient Functions Against Polynomials. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
2018	J	`jnl`	Existence of Simple Extractors. Electron. Colloquium Comput. Complex. Xue Chen, David Zuckerman
2018	J	`jnl`	Improved Extractors for Recognizable and Algebraic Sources. Electron. Colloquium Comput. Complex. Fu Li, David Zuckerman
2018	A*	`conf`	Simple Optimal Hitting Sets for Small-Success RL. FOCS William Hoza, David Zuckerman
2018	J	`jnl`	Simple Optimal Hitting Sets for Small-Success RL. Electron. Colloquium Comput. Complex. William Hoza, David Zuckerman
2016	J	`jnl`	Bitcoin Beacon. CoRR Iddo Bentov, Ariel Gabizon, David Zuckerman
2016	A*	`conf`	Explicit two-source extractors and resilient functions. STOC Eshan Chattopadhyay, David Zuckerman
2016	A	`conf`	New Extractors for Interleaved Sources. CCC Eshan Chattopadhyay, David Zuckerman
2016	J	`jnl`	Rectangles Are Nonnegative Juntas. SIAM J. Comput. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2016	A*	`conf`	Robust Fourier and Polynomial Curve Fitting. FOCS Venkatesan Guruswami, David Zuckerman
2016	J	`jnl`	Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. Comput. Complex. Zeev Dvir, David Zuckerman
2015	A	`ed.`	30th Conference on Computational Complexity, CCC 2015, Portland, Oregon, USA, June 17-19, 2015 CCC David Zuckerman
2015	A	`conf`	Deterministic Extractors for Additive Sources: Extended Abstract. ITCS Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman
2015	J	`jnl`	Explicit Two-Source Extractors and Resilient Functions. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, David Zuckerman
2015	J	`jnl`	Mining Circuit Lower Bound Proofs for Meta-Algorithms. Comput. Complex. Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2015	J	`jnl`	New Extractors for Interleaved Sources. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, David Zuckerman
2015	A*	`conf`	Rectangles Are Nonnegative Juntas. STOC Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2014	J	`jnl`	Deterministic Extractors for Additive Sources. CoRR Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman
2014	A	`conf`	Mining Circuit Lower Bound Proofs for Meta-algorithms. CCC Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2014	J	`jnl`	Non-Malleable Codes Against Constant Split-State Tampering. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, David Zuckerman
2014	A*	`conf`	Non-malleable Codes against Constant Split-State Tampering. FOCS Eshan Chattopadhyay, David Zuckerman
2014	J	`jnl`	On Low Discrepancy Samplings in Product Spaces of Motion Groups. CoRR Chandrajit L. Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman
2014	J	`jnl`	Privacy Amplification and Nonmalleable Extractors Via Character Sums. SIAM J. Comput. Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman
2014	J	`jnl`	Rectangles Are Nonnegative Juntas. Electron. Colloquium Comput. Complex. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2013	J	`jnl`	Mining Circuit Lower Bound Proofs for Meta-Algorithms. Electron. Colloquium Comput. Complex. Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2013	J	`jnl`	Pseudorandom Generators for Combinatorial Shapes. SIAM J. Comput. Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2013	J	`jnl`	Pseudorandom Generators for Polynomial Threshold Functions. SIAM J. Comput. Raghu Meka, David Zuckerman
2013	—	`conf`	Robust Pseudorandom Generators. ICALP (1) Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman
2013	J	`jnl`	Robust Pseudorandom Generators. Electron. Colloquium Comput. Complex. Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman
2013	J	`jnl`	Robust Pseudorandom Generators. IACR Cryptol. ePrint Arch. Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman
2012	A*	`conf`	Pseudorandomness from Shrinkage. FOCS Russell Impagliazzo, Raghu Meka, David Zuckerman
2012	J	`jnl`	Pseudorandomness from Shrinkage. Electron. Colloquium Comput. Complex. Russell Impagliazzo, Raghu Meka, David Zuckerman
2011	—	`ch.`	Another Proof That Studies in Complexity and Cryptography Oded Goldreich, David Zuckerman
2011	J	`jnl`	Deterministic extractors for small-space sources. J. Comput. Syst. Sci. Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
2011	J	`jnl`	Non-malleable extractors via character sums CoRR Trevor D. Wooley, David Zuckerman
2011	A*	`conf`	Privacy Amplification and Non-malleable Extractors via Character Sums. FOCS Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman
2011	A*	`conf`	Pseudorandom financial derivatives. EC David Zuckerman
2011	A*	`conf`	Pseudorandom generators for combinatorial shapes. STOC Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2010	J	`jnl`	Can Random Coin Flips Speed Up a Computer? CoRR David Zuckerman
2010	A	`conf`	Fooling Functions of Halfspaces under Product Distributions. CCC Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman
2010	J	`jnl`	Fooling functions of halfspaces under product distributions CoRR Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman
2010	J	`jnl`	Fooling functions of halfspaces under product distributions. Electron. Colloquium Comput. Complex. Yi Wu, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan
2010	A*	`conf`	Optimal Testing of Reed-Muller Codes. FOCS Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
2010	—	`ch.`	Optimal Testing of Reed-Muller Codes. Property Testing Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
2010	J	`jnl`	Pseudorandom Financial Derivatives CoRR David Zuckerman
2010	J	`jnl`	Pseudorandom Generators for Combinatorial Shapes. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2010	A*	`conf`	Pseudorandom generators for polynomial threshold functions. STOC Raghu Meka, David Zuckerman
2009	J	`jnl`	Optimal Testing of Reed-Muller Codes CoRR Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
2009	J	`jnl`	Optimal testing of Reed-Muller codes. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
2009	J	`jnl`	Pseudorandom Generators for Polynomial Threshold Functions CoRR Raghu Meka, David Zuckerman
2009	—	`conf`	Small-Bias Spaces for Group Products. APPROX-RANDOM Raghu Meka, David Zuckerman
2009	J	`jnl`	Testing low-degree polynomials over prime fields. Random Struct. Algorithms Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
2008	—	`conf`	Extractors for Three Uneven-Length Sources. APPROX-RANDOM Anup Rao, David Zuckerman
2008	A*	`conf`	List-decoding reed-muller codes over small fields. STOC Parikshit Gopalan, Adam R. Klivans, David Zuckerman
2008	A*	`conf`	Network Extractor Protocols. FOCS Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman
2007	J	`jnl`	Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. SIAM J. Comput. Jesse Kamp, David Zuckerman
2007	J	`jnl`	Interaction in Quantum Communication. IEEE Trans. Inf. Theory Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
2007	J	`jnl`	Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. Theory Comput. David Zuckerman
2007	J	`jnl`	Lossless Condensers, Unbalanced Expanders, And Extractors. Comb. Amnon Ta-Shma, Christopher Umans, David Zuckerman
2006	A*	`conf`	Deterministic extractors for small-space sources. STOC Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
2006	J	`jnl`	Extractors from Reed-Muller codes. J. Comput. Syst. Sci. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
2006	A*	`conf`	Linear degree extractors and the inapproximability of max clique and chromatic number. STOC David Zuckerman
2006	A*	`conf`	Random Selection with an Adversarial Majority. CRYPTO Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
2006	J	`jnl`	Random Selection with an Adversarial Majority. Electron. Colloquium Comput. Complex. Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
2005	J	`jnl`	Compression of Samplable Sources Electron. Colloquium Comput. Complex. Luca Trevisan, Salil P. Vadhan, David Zuckerman
2005	J	`jnl`	Compression of Samplable Sources. Comput. Complex. Luca Trevisan, Salil P. Vadhan, David Zuckerman
2005	J	`jnl`	Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number Electron. Colloquium Comput. Complex. David Zuckerman
2004	A	`conf`	Compression of Samplable Sources. CCC Luca Trevisan, Salil P. Vadhan, David Zuckerman
2004	J	`jnl`	Extractor codes. IEEE Trans. Inf. Theory Amnon Ta-Shma, David Zuckerman
2004	A*	`conf`	Testing Low-Degree Polynomials over Prime Fields. FOCS Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
2003	A*	`conf`	Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. FOCS Jesse Kamp, David Zuckerman
2002	J	`jnl`	Combinatorial bounds for list decoding. IEEE Trans. Inf. Theory Venkatesan Guruswami, Johan Håstad, Madhu Sudan, David Zuckerman
2002	—	`conf`	Expander Graphs for Digital Stream Authentication and Robust Overlay Networks. S&P Dawn Xiaodong Song, J. D. Tygar, David Zuckerman
2002	J	`jnl`	Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. SIAM J. Comput. Alexander Russell, Michael E. Saks, David Zuckerman
2001	A*	`conf`	Extractor codes. STOC Amnon Ta-Shma, David Zuckerman
2001	J	`jnl`	Extractors from Reed-Muller Codes Electron. Colloquium Comput. Complex. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
2001	A*	`conf`	Extractors from Reed-Muller Codes. FOCS Amnon Ta-Shma, David Zuckerman, Shmuel Safra
2001	A*	`conf`	Interaction in quantum communication and the complexity of set disjointness. STOC Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
2001	A*	`conf`	Loss-less condensers, unbalanced expanders, and extractors. STOC Amnon Ta-Shma, Christopher Umans, David Zuckerman
2001	J	`jnl`	Perfect Information Leader Election in log* n+O (1) Rounds. J. Comput. Syst. Sci. Alexander Russell, David Zuckerman
2000	J	`jnl`	Interaction in Quantum Communication Complexity CoRR Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
2000	J	`jnl`	Low discrepancy sets yield approximate min-wise independent permutation families. Inf. Process. Lett. Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
1999	J	`jnl`	Asymptotically good codes correcting insertions, deletions, and transpositions. IEEE Trans. Inf. Theory Leonard J. Schulman, David Zuckerman
1999	J	`jnl`	Computing with Very Weak Random Sources. SIAM J. Comput. Aravind Srinivasan, David Zuckerman
1999	J	`jnl`	Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. Comb. Avi Wigderson, David Zuckerman
1999	—	`conf`	Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families. RANDOM-APPROX Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
1999	A*	`conf`	Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. STOC Alexander Russell, Michael E. Saks, David Zuckerman
1999	J	`jnl`	Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
1998	—	`conf`	Extractors for Weak Random Sources and Their Applications. SWAT David Zuckerman
1998	J	`jnl`	Lower Bounds for Randomized Mutual Exclusion. SIAM J. Comput. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
1998	A*	`conf`	Perfect Information Leader Election in log* FOCS Alexander Russell, David Zuckerman
1997	J	`jnl`	Another proof that BPP subseteq PH (and more). Electron. Colloquium Comput. Complex. Oded Goldreich, David Zuckerman
1997	A*	`conf`	Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). SODA Leonard J. Schulman, David Zuckerman
1997	J	`jnl`	Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. Comb. Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
1997	J	`jnl`	Randomness-optimal oblivious sampling. Random Struct. Algorithms David Zuckerman
1996	J	`jnl`	Multiple cover time. Random Struct. Algorithms Peter Winkler, David Zuckerman
1996	J	`jnl`	On Unapproximable Versions of NP-Complete Problems. SIAM J. Comput. David Zuckerman
1996	J	`jnl`	Randomness is Linear in Space. J. Comput. Syst. Sci. Noam Nisan, David Zuckerman
1996	A*	`conf`	Randomness-Optimal Sampling, Extractors, and Constructive Leader Election. STOC David Zuckerman
1996	J	`jnl`	Simulating BPP Using a General Weak Random Source. Algorithmica David Zuckerman
1995	J	`jnl`	Derandomized Graph Products. Comput. Complex. Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman
1995	A*	`conf`	Tight analyses of two local load balancing algorithms. STOC Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
1994	A*	`conf`	Computing with Very Weak Random Sources FOCS Aravind Srinivasan, David Zuckerman
1993	A*	`conf`	Efficient construction of a small hitting set for combinatorial rectangles in high dimension. STOC Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
1993	A*	`conf`	Expanders that beat the eigenvalue bound: explicit construction and applications. STOC Avi Wigderson, David Zuckerman
1993	A*	`conf`	Lower bounds for randomized mutual exclusion. STOC Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
1993	A*	`conf`	More deterministic simulation in logspace. STOC Noam Nisan, David Zuckerman
1993	—	`conf`	NP-Complete Problems Have a Version That's Hard to Approximate. SCT David Zuckerman
1993	—	`conf`	Optimal Speedup of Las Vegas Algorithms. ISTCS Michael Luby, Alistair Sinclair, David Zuckerman
1993	J	`jnl`	Optimal Speedup of Las Vegas Algorithms. Inf. Process. Lett. Michael Luby, Alistair Sinclair, David Zuckerman
1992	J	`jnl`	A Technique for Lower Bounding the Cover Time. SIAM J. Discret. Math. David Zuckerman
1991	J	`jnl`	On the Time to Traverse all Edges of a Graph. Inf. Process. Lett. David Zuckerman
1991	A*	`conf`	Simulating BPP Using a General Weak Random Source FOCS David Zuckerman
1990	A*	`conf`	A Technique for Lower Bounding the Cover Time STOC David Zuckerman
1990	A*	`conf`	General Weak Random Sources FOCS David Zuckerman
1990	A*	`conf`	Security Preserving Amplification of Hardness FOCS Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman
1989	A*	`conf`	How to Recycle Random Bits FOCS Russell Impagliazzo, David Zuckerman