Michael Mitzenmacher received the Ph. D. degree in Computer 
Science from the University of California, Berkeley, in 
1996.  He worked at Digital Systems Research Center, Palo 
Alto, CA until January 1999, when he joined the faculty of 
Harvard University.  Currently he is the John L. Loeb 
associate professor of computer science.  He has written 
over 100 conference and journal papers on a variety of 
topics, including coding theory, compression, load 
balancing, peer-to-peer networks, bin-packing, and heuristic 
optimization algorithms.  He was the co-recipient of the 
2002 Information Theory Society Paper Award for his work on 
low-density parity-check codes.  He has recently co-
authored a textbook on randomized algorithms and 
probabilistic analysis with Eli Upfal that will be available 
in 2005.