Michael Mitzenmacher

Cited by

	All	Since 2018
Citations	44826	13227
h-index	87	48
i10-index	249	155

3000

1500

750

2250

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023128 252 375 567 733 993 1268 1444 1548 1633 1887 2173 2117 2308 2562 2650 2714 2906 2585 2648 2478 2528 2631 2672 261

Public access

View all

51 articles

3 articles

available

not available

Based on funding mandates

Co-authors

John W. ByersProfessor of Computer Science, Boston UniversityVerified email at cs.bu.edu
Andrei BroderDistinguished Scientist, GoogleVerified email at google.com
Amin ShokrollahiEPFLVerified email at epfl.ch
Daniel SpielmanProfessor of Computer Science, Yale UniversityVerified email at yale.edu
Michael T. GoodrichProfessor of Computer Science, University of California, IrvineVerified email at uci.edu
George VargheseProfessor of Computer Science, University of California, Los AngelesVerified email at cs.ucla.edu
Justin ThalerGeorgetown UniversityVerified email at georgetown.edu
Georgios ZervasAssociate Professor of Marketing, Questrom School of Business, Boston UniversityVerified email at bu.edu
Devavrat ShahMassachusetts Institute of TechnologyVerified email at mit.edu
Michalis FaloutsosU. C. RiversideVerified email at cs.ucr.edu
Marios IliofotouData Scientists & Engineer @ Splunk>Verified email at cs.ucr.edu
Muriel MedardProfessor of EECS, MITVerified email at mit.edu
João BarrosUniversidade do PortoVerified email at fe.up.pt
Moses CharikarProfessor of Computer Science, Stanford UniversityVerified email at cs.stanford.edu
Joe MarksUnity Software Inc.Verified email at ufa.ie
Marc NajorkGoogleVerified email at google.com
Andrea W. RichaPresident's Professor, Arizona State UniversityVerified email at asu.edu
S MuthukrishnanRutgers UnivVerified email at cs.rutgers.edu

Michael Mitzenmacher

Professor of Computer Science, Harvard University

Verified email at eecs.harvard.edu

Randomized Algorithms Internet Algorithms Networking Information Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis M Mitzenmacher, E Upfal Cambridge university press, 2017	3860	2017
Detecting novel associations in large data sets DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ... science 334 (6062), 1518-1524, 2011	2563	2011
Network applications of bloom filters: A survey A Broder, M Mitzenmacher Internet mathematics 1 (4), 485-509, 2004	2302	2004
A brief history of generative models for power law and lognormal distributions M Mitzenmacher Internet mathematics 1 (2), 226-251, 2004	2209	2004
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	1856	1998
The power of two choices in randomized load balancing M Mitzenmacher IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001	1503	2001
Privacy preserving keyword searches on remote encrypted data YC Chang, M Mitzenmacher ACNS 5 (3531), 442-455, 2005	1484	2005
Min-wise independent permutations AZ Broder, M Charikar, AM Frieze, M Mitzenmacher Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	1396	1998
Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001	1373	2001
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	1242	2001
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	1175	1997
Compressed bloom filters M Mitzenmacher Proceedings of the twentieth annual ACM symposium on Principles of …, 2001	991	2001
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	707	2002
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	668	2014
Network applications of bloom filters: A survey A Broder Allerton Conference, 2002, 2002	642	2002
The power of two random choices: A survey of techniques and results R Sitaraman	491	2001
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	487	1998
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	474	1999
Analysis of Random Processes via And-Or Tree Evaluation. M Luby, M Mitzenmacher, MA Shokrollahi SODA 98, 364-373, 1998	468	1998
An improved construction for counting bloom filters F Bonomi, M Mitzenmacher, R Panigrahy, S Singh, G Varghese Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006	465	2006

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors