Michael Mitzenmacher
Michael Mitzenmacher
Professor of Computer Science, Harvard University
Dirección de correo verificada de eecs.harvard.edu
Título
Citado por
Citado por
Año
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis
M Mitzenmacher, E Upfal
Cambridge university press, 2017
33802017
Network applications of bloom filters: A survey
A Broder, M Mitzenmacher
Internet mathematics 1 (4), 485-509, 2004
21142004
A brief history of generative models for power law and lognormal distributions
M Mitzenmacher
Internet mathematics 1 (2), 226-251, 2004
20352004
Detecting novel associations in large data sets
DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ...
science 334 (6062), 1518-1524, 2011
18562011
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
18001998
Privacy preserving keyword searches on remote encrypted data
YC Chang, M Mitzenmacher
International conference on applied cryptography and network security, 442-455, 2005
13532005
Efficient erasure correcting codes
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman
IEEE Transactions on Information Theory 47 (2), 569-584, 2001
13082001
The power of two choices in randomized load balancing
M Mitzenmacher
IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001
13022001
Min-wise independent permutations
AZ Broder, M Charikar, AM Frieze, M Mitzenmacher
Journal of Computer and System Sciences 60 (3), 630-659, 2000
12972000
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
11902001
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
11271997
Compressed bloom filters
M Mitzenmacher
IEEE/ACM transactions on networking 10 (5), 604-612, 2002
9412002
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
6862002
Network applications of bloom filters: A survey
A Broder, M Mitzenmacher, ABIM Mitzenmacher
Internet Mathematics, 2002
6142002
Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads
JW Byers, M Luby, M Mitzenmacher
IEEE INFOCOM'99. Conference on Computer Communications. Proceedings …, 1999
4681999
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
4571998
Analysis of Random Processes via And-Or Tree Evaluation.
M Luby, M Mitzenmacher, MA Shokrollahi
SODA 98, 364-373, 1998
4371998
Simple load balancing for distributed hash tables
J Byers, J Considine, M Mitzenmacher
International Workshop on Peer-to-Peer Systems, 80-87, 2003
4322003
The power of two random choices: A survey of techniques and results
AW Richa, M Mitzenmacher, R Sitaraman
Combinatorial Optimization 9, 255-304, 2001
4262001
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
4182014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20