Michael Mitzenmacher

from Wikipedia, the free encyclopedia

Michael David Mitzenmacher (* 1969 ) is an American computer scientist and professor at Harvard University .

Mitzenmacher received his bachelor's degree in mathematics and computer science summa cum laude from Harvard University in 1991, was at Cambridge University in 1991/92 (as a Churchill Fellow) and received his doctorate in 1996 from the University of California, Berkeley , with Alistair Sinclair (The Power of Two Choices in Randomized Load Balancing). He then went to the Digital Systems Research Center in Palo Alto . From 1999 he was an assistant professor at Harvard University, where he became an associate professor in 2002 and a professor in 2005.

He wrote a book with Eli Upfal on probabilistic methods and random algorithms in computer science. He is an expert in hash techniques and MinHash (1998), which he helped to develop, is used for document comparison by search engines on the Internet.

For his work on Low-Density Parity-Check-Codes (LDPC) - among other things as a co-developer of the Tornado Codes - he received the IEEE Information Theory Society Best Paper Award in 2002 and for his work on Fountain Codes (1998) in 2009 ACM SIGCOMM Test of Time Award. In 2014 he became a Fellow of the Association for Computing Machinery .

Fonts

  • with Eli Upfal: Probability and Computing, Cambridge University Press 2005
  • with John Byers, Michael Luby, Ashutosh Rege: A Digital Fountain Approach to Reliable Distribution of Bulk Data, Proc. of ACM SIGCOMM 1998
  • with Michael Luby , Amin Shokrollahi , Daniel A. Spielman : "Improved Low-Density Parity-Check Codes Using Irregular Graphs", IEEE Trans. Inform. Theory, February 2001
  • with Michael G. Luby, Amin Shokrollahi, Daniel A. Spielman, Volker Stemann: Practical Loss-Resilient Codes, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, ACM 1997, pp. 150–159.
  • with Andrei Z. Broder, Moses Charikar, Alan M. Frieze : Min-wise independent permutations, Proc. 30th ACM Symposium on Theory of Computing (STOC '98), ACM 1998, pp. 327-336

Web links

Individual evidence

  1. Michael Mitzenmacher in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used