David Zuckerman

ScholarGPS® ID: 57620802270248

Affiliation

University of Texas at Austin, Austin, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Information Theory | Combinatorial Optimization | Cryptography | Mathematical Optimization | Privacy

Metrics Summary

Publication Count

Predicted Citations

5,893

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Small-Space Spectral Sparsification via Bounded-Independence Sampling (journal article) Doron, Dean \| Murtagh, Jack \| Vadhan, Salil \| Zuckerman, David ACM Transactions on Computation Theory, volume 16, issue 2, pages 1-32 (2024). 10.1145/3637034 Cite \| Source
Almost Chor-Goldreich Sources and Adversarial Random Walks (conference) Doron, Dean \| Moshkovitz, Dana \| Oh, Justin \| Zuckerman, David STOC '23: 55th Annual ACM Symposium on Theory of Computing (2023) Orlando FL USA 10.1145/3564246.3585134 Cite \| Source
Nearly Optimal Pseudorandomness from Hardness (journal article) Doron, Dean \| Moshkovitz, Dana \| Oh, Justin \| Zuckerman, David Journal of the ACM, volume 69, issue 6, pages 1-55 (2022). 10.1145/3555307 Cited by (4) \| Cite \| Source
Extractors and Secret Sharing Against Bounded Collusion Protocols (conference) Chattopadhyay, Eshan \| Goodman, Jesse \| Goyal, Vipul \| Kumar, Ashutosh \| Li, Xin \| Meka, Raghu \| Zuckerman, David 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA 10.1109/FOCS46700.2020.00117 Cited by (13) \| Cite \| Source
Nearly Optimal Pseudorandomness From Hardness (conference) Doron, Dean \| Moshkovitz, Dana \| Oh, Justin \| Zuckerman, David 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA 10.1109/FOCS46700.2020.00102 Cited by (6) \| Cite \| Source
XOR lemmas for resilient functions against polynomials (conference) Chattopadhyay, Eshan \| Hatami, Pooya \| Hosseini, Kaave \| Lovett, Shachar \| Zuckerman, David STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing (2020) Chicago IL USA 10.1145/3357713.3384242 Cited by (2) \| Cite \| Source
Explicit two-source extractors and resilient functions (journal article) Chattopadhyay, Eshan \| Zuckerman, David Annals of Mathematics, volume 189, issue 3 (2019). 10.4007/annals.2019.189.3.1 Cited by (23) \| Cite \| Source
Pseudorandomness from Shrinkage (journal article) Impagliazzo, Russell \| Meka, Raghu \| Zuckerman, David Journal of the ACM, volume 66, issue 2, pages 1-16 (2019). 10.1145/3230630 Cited by (8) \| Cite \| Source
Simple Optimal Hitting Sets for Small-Success RL (conference) Hoza, William \| Zuckerman, David 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018) Paris 10.1109/FOCS.2018.00015 Cited by (1) \| Cite \| Source
Explicit two-source extractors and resilient functions (conference) Chattopadhyay, Eshan \| Zuckerman, David STOC '16: Symposium on Theory of Computing (2016) Cambridge MA USA 10.1145/2897518.2897528 Cited by (53) \| Cite \| Source
New extractors for interleaved sources (conference) Chattopadhyay, Eshan \| Zuckerman, David Conference on Computational Complexity (2016) 10.4230/LIPIcs.CCC.2016.7 Cited by (5) \| Cite \| Source
Rectangles Are Nonnegative Juntas (journal article) Göös, Mika \| Lovett, Shachar \| Meka, Raghu \| Watson, Thomas \| Zuckerman, David SIAM Journal on Computing, volume 45, issue 5, pages 1835-1869 (2016). 10.1137/15M103145X Cited by (28) \| Cite \| Source \| Open Access
Rectangles Are Nonnegative Juntas (conference) Göös, Mika \| Lovett, Shachar \| Meka, Raghu \| Watson, Thomas \| Zuckerman, David STOC '15: Symposium on Theory of Computing (2015) Portland Oregon USA 10.1145/2746539.2746596 Cited by (27) \| Cite \| Source
Mining Circuit Lower Bound Proofs for Meta-Algorithms (journal article) Chen, Ruiwen \| Kabanets, Valentine \| Kolokolova, Antonina \| Shaltiel, Ronen \| Zuckerman, David computational complexity, volume 24, issue 2, pages 333-392 (2015). 10.1007/s00037-015-0100-0 Cited by (36) \| Cite \| Source \| Open Access
Deterministic Extractors for Additive Sources (conference) Bhowmick, Abhishek \| Gabizon, Ariel \| Le, Thái Hoang \| Zuckerman, David ITCS'15: Innovations in Theoretical Computer Science (2015) Rehovot Israel 10.1145/2688073.2688090 Cited by (1) \| Cite \| Source \| Open Access
Front Matter, Table of Contents, Preface, Conference Organization (conference) Zuckerman, David Conference on Computational Complexity (2015) 10.4230/LIPIcs.CCC.2015.i Cite \| Source
Non-malleable Codes against Constant Split-State Tampering (conference) Chattopadhyay, Eshan \| Zuckerman, David 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) (2014) Philadelphia, PA, USA 10.1109/FOCS.2014.40 Cited by (56) \| Cite \| Source
Mining Circuit Lower Bound Proofs for Meta-algorithms (conference) Chen, Ruiwen \| Kabanets, Valentine \| Kolokolova, Antonina \| Shaltiel, Ronen \| Zuckerman, David 2014 IEEE Conference on Computational Complexity (CCC) (2014) Vancouver, BC, Canada 10.1109/CCC.2014.34 Cited by (19) \| Cite \| Source \| Open Access
Privacy Amplification and Nonmalleable Extractors Via Character Sums (journal article) Dodis, Yevgeniy \| Li, Xin \| Wooley, Trevor D. \| Zuckerman, David SIAM Journal on Computing, volume 43, issue 2, pages 800-830 (2014). 10.1137/120868414 Cited by (30) \| Cite \| Source \| Open Access
Robust Pseudorandom Generators (book chapter) In Automata, Languages, and Programming Ishai, Yuval \| Kushilevitz, Eyal \| Li, Xin \| Ostrovsky, Rafail \| Prabhakaran, Manoj \| Sahai, Amit \| Zuckerman, David Springer Berlin Heidelberg (2013) 10.1007/978-3-642-39206-1_49 Cited by (24) \| Cite \| Source \| Open Access