David Zuckerman

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 37

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

STOC

FOCS

Publications

Zhiyang Xun, David Zuckerman
Near-Optimal Averaging Samplers. Electron. Colloquium Comput. Complex. (2024)
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
Almost Chor-Goldreich Sources and Adversarial Random Walks. STOC (2023)
Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
Extractors for Images of Varieties. STOC (2023)
Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
Extractors for Images of Varieties. CoRR (2022)
Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
The Space Complexity of Sampling. ITCS (2022)
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
Almost Chor-Goldreich Sources and Adversarial Random Walks. Electron. Colloquium Comput. Complex. (2022)
Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
Extractors for Images of Varieties. Electron. Colloquium Comput. Complex. (2022)
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
Nearly Optimal Pseudorandomness from Hardness. J. ACM 69 (6) (2022)
Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
The Space Complexity of Sampling. Electron. Colloquium Comput. Complex. 28 (2021)
William M. Hoza, David Zuckerman
Simple Optimal Hitting Sets for Small-Success RL. SIAM J. Comput. 49 (4) (2020)
Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
Spectral Sparsification via Bounded-Independence Sampling. Electron. Colloquium Comput. Complex. 27 (2020)
Ashutosh Kumar, Raghu Meka, David Zuckerman
Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2020 (2020)
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
Nearly Optimal Pseudorandomness From Hardness. FOCS (2020)
Dana Moshkovitz, Justin Oh, David Zuckerman
Randomness Efficient Noise Stability and Generalized Small Bias Sets. FSTTCS (2020)
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
XOR lemmas for resilient functions against polynomials. STOC (2020)
Ashutosh Kumar, Raghu Meka, David Zuckerman
Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. Electron. Colloquium Comput. Complex. 27 (2020)
Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
Spectral Sparsification via Bounded-Independence Sampling. CoRR (2020)
Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
Spectral Sparsification via Bounded-Independence Sampling. ICALP (2020)
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman
Extractors and Secret Sharing Against Bounded Collusion Protocols. FOCS (2020)
Fu Li, David Zuckerman
Improved Extractors for Recognizable and Algebraic Sources. APPROX-RANDOM (2019)
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
XOR Lemmas for Resilient Functions Against Polynomials. Electron. Colloquium Comput. Complex. 26 (2019)
David Zuckerman
Certifiably Pseudorandom Financial Derivatives. SIAM J. Comput. 48 (6) (2019)
Russell Impagliazzo, Raghu Meka, David Zuckerman
Pseudorandomness from Shrinkage. J. ACM 66 (2) (2019)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. CoRR (2019)
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
Nearly Optimal Pseudorandomness From Hardness. Electron. Colloquium Comput. Complex. 26 (2019)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Electron. Colloquium Comput. Complex. 26 (2019)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. ICALP (2019)
William Hoza, David Zuckerman
Simple Optimal Hitting Sets for Small-Success RL. FOCS (2018)
William Hoza, David Zuckerman
Simple Optimal Hitting Sets for Small-Success RL. Electron. Colloquium Comput. Complex. 25 (2018)
Fu Li, David Zuckerman
Improved Extractors for Recognizable and Algebraic Sources. Electron. Colloquium Comput. Complex. 25 (2018)
Xue Chen, David Zuckerman
Existence of Simple Extractors. Electron. Colloquium Comput. Complex. 25 (2018)
Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
Rectangles Are Nonnegative Juntas. SIAM J. Comput. 45 (5) (2016)
Zeev Dvir, David Zuckerman
Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. Comput. Complex. 25 (2) (2016)
Venkatesan Guruswami, David Zuckerman
Robust Fourier and Polynomial Curve Fitting. FOCS (2016)
Eshan Chattopadhyay, David Zuckerman
New Extractors for Interleaved Sources. Computational Complexity Conference (2016)
Iddo Bentov, Ariel Gabizon, David Zuckerman
Bitcoin Beacon. CoRR (2016)
Eshan Chattopadhyay, David Zuckerman
Explicit two-source extractors and resilient functions. STOC (2016)
Eshan Chattopadhyay, David Zuckerman
Explicit Two-Source Extractors and Resilient Functions. Electron. Colloquium Comput. Complex. 22 (2015)
Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman
Deterministic Extractors for Additive Sources: Extended Abstract. ITCS (2015)
Eshan Chattopadhyay, David Zuckerman
New Extractors for Interleaved Sources. Electron. Colloquium Comput. Complex. 22 (2015)
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Comput. Complex. 24 (2) (2015)
Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
Rectangles Are Nonnegative Juntas. STOC (2015)
Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman
Privacy Amplification and Nonmalleable Extractors Via Character Sums. SIAM J. Comput. 43 (2) (2014)
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
Mining Circuit Lower Bound Proofs for Meta-algorithms. Computational Complexity Conference (2014)
Eshan Chattopadhyay, David Zuckerman
Non-Malleable Codes Against Constant Split-State Tampering. Electron. Colloquium Comput. Complex. 21 (2014)
Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
Rectangles Are Nonnegative Juntas. Electron. Colloquium Comput. Complex. 21 (2014)
Eshan Chattopadhyay, David Zuckerman
Non-malleable Codes against Constant Split-State Tampering. FOCS (2014)
Chandrajit L. Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman
On Low Discrepancy Samplings in Product Spaces of Motion Groups. CoRR (2014)
Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman
Deterministic Extractors for Additive Sources. CoRR (2014)
Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman
Robust Pseudorandom Generators. ICALP (1) (2013)
Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
Pseudorandom Generators for Combinatorial Shapes. SIAM J. Comput. 42 (3) (2013)
Raghu Meka, David Zuckerman
Pseudorandom Generators for Polynomial Threshold Functions. SIAM J. Comput. 42 (3) (2013)
Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman
Robust Pseudorandom Generators. IACR Cryptol. ePrint Arch. 2013 (2013)
Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman
Robust Pseudorandom Generators. Electron. Colloquium Comput. Complex. 20 (2013)
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Electron. Colloquium Comput. Complex. 20 (2013)
Russell Impagliazzo, Raghu Meka, David Zuckerman
Pseudorandomness from Shrinkage. Electron. Colloquium Comput. Complex. 19 (2012)
Russell Impagliazzo, Raghu Meka, David Zuckerman
Pseudorandomness from Shrinkage. FOCS (2012)
Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
Pseudorandom generators for combinatorial shapes. STOC (2011)
Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
Deterministic extractors for small-space sources. J. Comput. Syst. Sci. 77 (1) (2011)
David Zuckerman
Pseudorandom financial derivatives. EC (2011)
Trevor D. Wooley, David Zuckerman
Non-malleable extractors via character sums CoRR (2011)
Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman
Privacy Amplification and Non-malleable Extractors via Character Sums. FOCS (2011)
Raghu Meka, David Zuckerman
Pseudorandom generators for polynomial threshold functions. STOC (2010)
Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
Pseudorandom Generators for Combinatorial Shapes. Electron. Colloquium Comput. Complex. 17 (2010)
Yi Wu, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan
Fooling functions of halfspaces under product distributions. Electron. Colloquium Comput. Complex. 17 (2010)
David Zuckerman
Can Random Coin Flips Speed Up a Computer? CoRR (2010)
Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
Optimal Testing of Reed-Muller Codes. FOCS (2010)
David Zuckerman
Pseudorandom Financial Derivatives CoRR (2010)
Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman
Fooling Functions of Halfspaces under Product Distributions. Computational Complexity Conference (2010)
Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman
Fooling functions of halfspaces under product distributions CoRR (2010)
Raghu Meka, David Zuckerman
Small-Bias Spaces for Group Products. APPROX-RANDOM (2009)
Raghu Meka, David Zuckerman
Pseudorandom Generators for Polynomial Threshold Functions CoRR (2009)
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
Testing low-degree polynomials over prime fields. Random Struct. Algorithms 35 (2) (2009)
Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
Optimal Testing of Reed-Muller Codes CoRR (2009)
Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
Optimal testing of Reed-Muller codes. Electron. Colloquium Comput. Complex. 16 (2009)
Parikshit Gopalan, Adam R. Klivans, David Zuckerman
List-decoding reed-muller codes over small fields. STOC (2008)
Anup Rao, David Zuckerman
Extractors for Three Uneven-Length Sources. APPROX-RANDOM (2008)
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman
Network Extractor Protocols. FOCS (2008)
David Zuckerman
Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. Theory Comput. 3 (1) (2007)
Jesse Kamp, David Zuckerman
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. SIAM J. Comput. 36 (5) (2007)
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
Interaction in Quantum Communication. IEEE Trans. Inf. Theory 53 (6) (2007)
Amnon Ta-Shma, Christopher Umans, David Zuckerman
Lossless Condensers, Unbalanced Expanders, And Extractors. Comb. 27 (2) (2007)
Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
Random Selection with an Adversarial Majority. CRYPTO (2006)
Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
Deterministic extractors for small-space sources. STOC (2006)
Amnon Ta-Shma, David Zuckerman, Shmuel Safra
Extractors from Reed-Muller codes. J. Comput. Syst. Sci. 72 (5) (2006)
David Zuckerman
Linear degree extractors and the inapproximability of max clique and chromatic number. STOC (2006)
Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
Random Selection with an Adversarial Majority. Electron. Colloquium Comput. Complex. 13 (026) (2006)
David Zuckerman
Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number Electron. Colloquium Comput. Complex. (100) (2005)
Luca Trevisan, Salil P. Vadhan, David Zuckerman
Compression of Samplable Sources Electron. Colloquium Comput. Complex. (012) (2005)
Luca Trevisan, Salil P. Vadhan, David Zuckerman
Compression of Samplable Sources. Comput. Complex. 14 (3) (2005)
Amnon Ta-Shma, David Zuckerman
Extractor codes. IEEE Trans. Inf. Theory 50 (12) (2004)
Luca Trevisan, Salil P. Vadhan, David Zuckerman
Compression of Samplable Sources. Computational Complexity Conference (2004)
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
Testing Low-Degree Polynomials over Prime Fields. FOCS (2004)
Jesse Kamp, David Zuckerman
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. FOCS (2003)
Venkatesan Guruswami, Johan Håstad, Madhu Sudan, David Zuckerman
Combinatorial bounds for list decoding. IEEE Trans. Inf. Theory 48 (5) (2002)
Dawn Xiaodong Song, J. D. Tygar, David Zuckerman
Expander Graphs for Digital Stream Authentication and Robust Overlay Networks. IEEE Symposium on Security and Privacy (2002)
Alexander Russell, Michael E. Saks, David Zuckerman
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. SIAM J. Comput. 31 (6) (2002)
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
Interaction in quantum communication and the complexity of set disjointness. STOC (2001)
Amnon Ta-Shma, David Zuckerman, Shmuel Safra
Extractors from Reed-Muller Codes. FOCS (2001)
Amnon Ta-Shma, Christopher Umans, David Zuckerman
Loss-less condensers, unbalanced expanders, and extractors. STOC (2001)

David Zuckerman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David Zuckerman