Faculty profile 2
Zuckerman does research in the role of randomness in computation. In particular, much of his research has focused on randomness extraction, pseudorandomness, coding theory, cryptography, and other aspects of complexity theory.
ACM Fellow, 2013
John S. Guggenheim Memorial Foundation Fellowship, 2004-05
David and Lucile Packard Fellowship for Science and Engineering, 1996-2006
Alfred P. Sloan Research Fellowship, 1996-2000
NSF Young Investigator Award, 1994-2000
Machtey Award (Best Student Paper Award), FOCS, 1990
William Lowell Putnam Mathematical Competition, Fellow (top 6 in nation) in 1986; 8th highest in 1985.
E. Chattopadhyay and D. Zuckerman, "Explicit Two-Source Extractors and Resilient Functions,"
ECCC Technical Report TR15-119, 2015.
E. Chattopadhyay and D. Zuckerman, "Non-malleable codes against constant split-state tampering,"
55th Annual IEEE Symposium on Foundations of Computer Science, 2014, pp. 306-315.
Y. Dodis, X. Li, T.D. Wooley, and D. Zuckerman, "Privacy amplification and non-malleable extractors
via character sums," SIAM Journal on Computing, 43 (2014): 800-830. Special issue on FOCS 2011.
Preliminary version in 52nd Annual IEEE Symposium on Foundations of Computer Science, 2011.
R. Meka and D. Zuckerman, "Pseudorandom generators for polynomial threshold functions," SIAM
Journal on Computing, 42 (2013): 1275-1301. Special issue on STOC 2010. Preliminary version in
42nd Annual ACM Symposium on Theory of Computing, 2010, pp. 427-436.
R. Impagliazzo, R. Meka, and D. Zuckerman "Pseudorandomness from Shrinkage," 53rd Annual IEEE
Symposium on Foundations of Computer Science, 2012, pp. 111-119.
"Explicit Two-Source Extractors and Resilient Functions." Plenary session, Oberwolfach Complexity Theory Meeting, November 2015; TCS+ Online Seminar, October 2015; Simons Workshop on Connections Between Algorithm Design and Complexity Theory, September 2015.
"When is Randomness Extraction Possible?" Workshop on the Foundations of Randomness, Stellenbosch Institute for Advanced Study, Stellenbosch, South Africa, October 2015.
"Non-Malleable Codes Against Constant Split-State Tampering." Simons Workshop on Coding: From Practice to Theory, Berkeley, February 2015; Dagstuhl Workshop on Algebra in Computational Complexity, Dagstuhl, Germany, September 2014.
"Pseudorandomness from Shrinkage." Microsoft Research Silicon Valley, July 2014; MIT, May 2014; BIRS Workshop “Computational Complexity”, Banff, Canada, July 2013; Weizmann Institute, Israel, June 2013; ELC Tokyo Complexity Workshop, March 2013; Dagstuhl Workshop on Algebraic and Combinatorial Methods in Computational Complexity, Dagstuhl, Germany, October 2012; University of Washington, October 2012.
Co-organizer, Simons Program on Pseudorandomness, UC Berkeley, Spring 2017.
Guest Editor, Computational Complexity, special issue devoted to CCC 2015.
Editorial Board, Theory of Computing, 2005-15.
Editorial Board, ACM Transactions on Computation Theory, 2008-13.
Program Committee Chair, 30th Computational Complexity Conference (CCC), 2015.
Program Committee Member, 45th Annual ACM Symposium on Theory of Computing (STOC), 2013.
Co-organizing the Simons Program on Pseudorandomness (Spring 2017) with mathematicians.