Michael Mitzenmacher

Michael Mitzenmacher
Michael Mitzenmacher (September 2009)
Residence	USA
Nationality	American
Fields	Algorithms
Institutions	Harvard University
Alma mater	University of California, Berkeley
Doctoral advisor	Alistair Sinclair

Michael D. Mitzenmacher is an American computer scientist working in algorithms. He is professor of computer science in the School of Engineering and Applied Sciences at Harvard University and area dean of computer science since July 2010.

Education

Michael Mitzenmacher received his Ph.D. in computer science at the University of California, Berkeley in 1996 under the supervision of Alistair Sinclair. He joined Harvard University in 1999.^[1]

Research

Mitzenmacher’s research covers the design an analysis of randomised algorithms and processes. With Eli Upfal he is the author of a textbook Mitzenmacher & Upfal (2005) on randomized algorithms and probabilistic techniques in computer science. His Ph.D. thesis was on the analysis of simple randomised load balancing schemes. He is a leading expert in hash function applications such as Bloom filters,^[2] cuckoo hashing,^[3] and locality sensitive hashing. His work on min-wise independence gives a fast way to estimate similarity of electronic documents, and is used in internet search engines.^[4]

Mitzenmacher has also worked on erasure codes and error-correcting codes. His joint paper Luby et al. (2001) on low-density parity-check codes received the 2002 IEEE Information Theory Society Best Paper Award. His joint paper (Byers et al. (1998)) on fountain codes received the 2009 ACM SIGCOMM Test of Time Paper Award.^[5]

Mitzenmacher has written over 100 conference and journal publications. He has served on dozens of programme committees in computer science, information theory, and networks, and chaired the programme committee of the Symposium on Theory of Computing in 2009. He belongs to the editorial board of SIAM Journal on Computing, Internet Mathematics, and Journal of Interconnection Networks.

References

1. ^ Short bio at Mitzenmacher’s web page
2. ^ Broder & Mitzenmacher (2005)
3. ^ Mitzenmacher (2009)
4. ^ Michael D. Mitzenmacher profile at Harvard University.
5. ^ SIGCOMM test of time awards

Notable publications

• Byers, John; Luby, Michael; Mitzenmacher, Michael; Rege, Ashutosh (1999), "A Digital Fountain Approach to Reliable Distribution of Bulk Data", Proc. of ACM SIGCOMM 1998 
• Broder, Andrei; Mitzenmacher, Michael (2005), "Network Applications of Bloom Filters: A Survey", Internet Mathematics 1 (4): 485–509, http://www.eecs.harvard.edu/~michaelm/postscripts/im2005b.pdf 
• Luby, Michael; Mitzenmacher, Michael; Shokrollahi, Amin; Spielman, Daniel (2001), "Improved Low-Density Parity Check Codes Using Irregular Graphs", IEEE Transactions on Information Theory 47 (2): 585–598 
• Mitzenmacher, Michael, "Some Open Questions Related to Cuckoo Hashing", Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7–9, 2009., pp. 1–10 
• Mitzenmacher, Michael; Upfal, Eli (2005), Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge University Press 

External links

• Mitzenmacher’s web page

Persondata
Name	Mitzenmacher, Michael
Alternative names
Short description
Date of birth
Place of birth
Date of death
Place of death