Michael Mitzenmacher | |
|---|---|
| Nationality | American |
| Alma mater | Harvard University University of Cambridge University of California, Berkeley |
| Awards | ACM Fellow (2014) |
| Scientific career | |
| Fields | Algorithms |
| Institutions | Harvard University |
| Doctoral advisor | Alistair Sinclair |
| Website | http://mybiasedcoin.blogspot.com/ |
Michael David Mitzenmacher is an American computer scientist working in algorithms. He is Professor of Computer Science at theHarvard John A. Paulson School of Engineering and Applied Sciences and was area dean of computer science July 2010 to June 2013. He also runsMy Biased Coin, a blog abouttheoretical computer science.
In 1986, Mitzenmacher attended theResearch Science Institute. Mitzenmacher earned hisAB at Harvard, where he was on the team that won the 1990 North American Collegiate Bridge Championship. He attended theUniversity of Cambridge on aChurchill Scholarship from 1991–1992. Mitzenmacher received hisPhD in computer science at theUniversity of California, Berkeley in 1996 under the supervision ofAlistair Sinclair.[1] He joinedHarvard University in 1999.[2]
Mitzenmacher’s research covers the design and analysis of randomised algorithms and processes. WithEli Upfal he is the author of a textbookMitzenmacher & Upfal (2005) on randomized algorithms and probabilistic techniques in computer science. Mitzenmacher's PhD thesis was on the analysis of simple randomisedload balancing schemes. He is an expert inhash function applications such asBloom filters,[3]cuckoo hashing,[4] andlocality-sensitive hashing. His work onmin-wise independence gives a fast way to estimate similarity of electronic documents and is used in internet search engines.[5] Mitzenmacher has also worked on erasure codes and error-correcting codes.
Mitzenmacher has authored over 100 conference and journal publications. He has served on dozens of program committees in computer science, information theory, and networks, and chaired the program committee of theSymposium on Theory of Computing in 2009. He belongs to the editorial board ofSIAM Journal on Computing, Internet Mathematics, andJournal of Interconnection Networks.
Mitzenmacher became afellow of theAssociation for Computing Machinery in 2014.[6] His joint paper (Luby et al. 2001) onlow-density parity-check codes received the 2002IEEE Information Theory Society Best Paper Award. His joint paper (Byers et al. 1998) onfountain codes received the2009 ACMSIGCOMM Test of Time Paper Award.[7] In 2019, he was elected as an IEEE Fellow.[8]
