Biography:David Zuckerman (computer scientist)
David Zuckerman | |
|---|---|
| Nationality | American |
| Alma mater | University of California at Berkeley Harvard University |
| Known for | Pseudorandomness |
| Awards | ACM Fellow Simons Investigator |
| Scientific career | |
| Fields | Theoretical computer science |
| Institutions | University of Texas at Austin |
| Thesis | Computing Efficiently Using General Weak Random Sources (1991) |
| Doctoral advisor | Umesh Vazirani |
David Zuckerman is an American theoretical computer scientist whose work concerns randomness in computation.[1] He is a professor of computer science at the University of Texas at Austin.[2]
Biography
Zuckerman received an A.B. in mathematics from Harvard University in 1987, where he was a Putnam Fellow in 1986.[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.[4][5] He then worked as a postdoctoral fellow at the Massachusetts Institute of Technology and Hebrew University of Jerusalem before joining the University of Texas in 1994. Zuckerman was named a Fellow of the ACM in 2013, and a Simons Investigator in 2016.[6][7]
Research
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.[8][9] Zuckerman is best known for his work on randomness extractors. 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.[13]
References
- ↑ "~diz/RandomSurvey". cs.utexas.edu. https://www.cs.utexas.edu/~diz/RandomSurvey.pps. Retrieved 2016-09-18.
- ↑ "David Zuckerman's website". https://www.cs.utexas.edu/~diz/.
- ↑ "Putnam Competition Individual and Team Winners". Mathematical Association of America. http://www.maa.org/programs/maa-awards/putnam-competition-individual-and-team-winners.
- ↑ "David Zuckerman's Curriculum Vitae". https://www.cs.utexas.edu/~diz/cv.pdf.
- ↑ "David Zuckerman - The Mathematics Genealogy Project". genealogy.ams.org. http://www.genealogy.ams.org/id.php?id=119734. Retrieved 2016-09-18.
- ↑ "ACM Fellows - Award Winners: List By Year". awards.acm.org. http://awards.acm.org/fellow/year.cfm. Retrieved 2016-09-18.
- ↑ "Simons Investigators Awardees | Simons Foundation". simonsfoundation.org. https://www.simonsfoundation.org/mathematics-and-physical-science/simons-investigators/simons-investigators-awardees/. Retrieved 2016-09-18.
- ↑ "David Zuckerman's Publications". cs.utexas.edu. https://www.cs.utexas.edu/~diz/pubs/. Retrieved 2016-09-18.
- ↑ "dblp: David Zuckerman". dblp.uni-trier.de. http://dblp.uni-trier.de/pers/hd/z/Zuckerman:David. Retrieved 2016-09-18.
- ↑ Chattopadhyay, Eshan; Zuckerman, David (23 July 2015). "ECCC - TR15-119". eccc.hpi-web.de. http://eccc.hpi-web.de/report/2015/119/. Retrieved 2016-09-18.
- ↑ "New technique produces real randomness | Science News". sciencenews.org. 27 May 2016. https://www.sciencenews.org/article/new-technique-produces-real-randomness. Retrieved 2016-09-18.
- ↑ "Purifying spoiled randomness with spoiled randomness – Not so Great Ideas in Theoretical Computer Science". mittheory.wordpress.com. 15 August 2015. https://mittheory.wordpress.com/2015/08/15/purifying-spoiled-randomness-with-spoiled-randomness/. Retrieved 2016-09-18.
- ↑ "Computational Complexity: STOC 2016". blog.computationalcomplexity.org. http://blog.computationalcomplexity.org/2016/06/stoc-2016.html. Retrieved 2016-09-18.
 |  |
