[3] He went on to earn a Ph.D. in computer science from the University of California at Berkeley in 1991 advised by Umesh Vazirani.
[6][7] Most of Zuckerman's work concerns randomness in computation, and especially pseudorandomness.
He has written over 80 papers on topics including randomness extractors, pseudorandom generators, coding theory, and cryptography.
In 2015 Zuckerman and his student Eshan Chattopadhyay solved an important open problem in the area by giving the first explicit construction of two-source extractors.
[10][11][12] The resulting paper won a best-paper award at the 2016 ACM Symposium on Theory of Computing.