Michael Mitzenmacher is a Professor of Computer Science in the
Division of Engineering and Applied Sciences at Harvard University.
Michael has authored or co-authored over 100 conference and journal
publications on a variety of topics, including Internet algorithms,
hashing, load-balancing, erasure codes, error-correcting codes,
compression, bin-packing, and power laws. His work on low-density
parity-check codes shared the 2002 IEEE Information Theory Society
Best Paper Award.  His first textbook on probabilistic techniques in
computer science, co-written with Eli Upfal, was published in 2005 by
Cambridge University Press.  

Michael Mitzenmacher graduated summa cum laude with a degree in
mathematics and computer science from Harvard in 1991.  After studying
math for a year in Cambridge, England, on the Churchill Scholarship,
he obtained his Ph. D. in computer science at U.C. Berkeley in 1996.
He then worked at Digital Systems Research Center until joining the
Harvard faculty in 1999.