Follow
Michael Mitzenmacher
Michael Mitzenmacher
Professor of Computer Science, Harvard University
Verified email at eecs.harvard.edu
Title
Cited by
Cited by
Year
Probability and computing
M Mitzenmacher, E Upfal
Cambridge University, 2005
51832005
Detecting novel associations in large data sets
DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ...
science 334 (6062), 1518-1524, 2011
40872011
Network applications of bloom filters: A survey
A Broder, M Mitzenmacher
Internet mathematics 1 (4), 485-509, 2004
25352004
A brief history of generative models for power law and lognormal distributions
M Mitzenmacher
Internet mathematics 1 (2), 226-251, 2004
25182004
A digital fountain approach to reliable distribution of bulk data
JW Byers, M Luby, M Mitzenmacher, A Rege
ACM SIGCOMM computer communication review 28 (4), 56-67, 1998
19731998
The power of two choices in randomized load balancing
M Mitzenmacher
IEEE transactions on parallel and distributed systems 12 (10), 1094-1104, 2002
19212002
Min-wise independent permutations
AZ Broder, M Charikar, AM Frieze, M Mitzenmacher
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
16191998
Privacy preserving keyword searches on remote encrypted data
YC Chang, M Mitzenmacher
International conference on applied cryptography and network security, 442-455, 2005
15382005
Efficient erasure correcting codes
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman
IEEE Transactions on Information Theory 47 (2), 569-584, 2001
14802001
Improved low-density parity-check codes using irregular graphs
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman
IEEE Transactions on information Theory 47 (2), 585-598, 2001
13322001
Practical loss-resilient codes
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman, V Stemann
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
12101997
Cuckoo filter: Practically better than bloom
B Fan, DG Andersen, M Kaminsky, MD Mitzenmacher
Proceedings of the 10th ACM International on Conference on emerging …, 2014
12022014
Compressed bloom filters
M Mitzenmacher
Proceedings of the twentieth annual ACM symposium on Principles of …, 2001
10722001
A digital fountain approach to asynchronous reliable multicast
JW Byers, M Luby, M Mitzenmacher
IEEE Journal on Selected areas in Communications 20 (8), 1528-1540, 2002
7342002
Network applications of bloom filters: A survey
A Broder, M Mitzenmacher
2002 40th Allerton Conference on Communication, Control, and Computing …, 2002
6362002
The power of two random choices: A survey of techniques and results
R Sitaraman
5752001
An improved construction for counting bloom filters
F Bonomi, M Mitzenmacher, R Panigrahy, S Singh, G Varghese
European Symposium on algorithms, 684-695, 2006
5692006
Analysis of low density codes and improved designs using irregular graphs
M Luby, M Mitzenmacher, A Shokrollah, D Spielman
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
5151998
Analysis of Random Processes via And-Or Tree Evaluation.
M Luby, M Mitzenmacher, MA Shokrollahi
SODA 98, 364-373, 1998
4851998
On compressing social networks
F Chierichetti, R Kumar, S Lattanzi, M Mitzenmacher, A Panconesi, ...
Proceedings of the 15th ACM SIGKDD international conference on Knowledge …, 2009
4812009
The system can't perform the operation now. Try again later.
Articles 1–20