Michael Mitzenmacher

Citada per

	Totes	Des de 2020
Citacions	50610	13675
Índex h	91	49
Índex i10	274	161

3000

1500

750

2250

20002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025262 371 568 710 1020 1275 1440 1561 1653 1896 2154 2124 2311 2580 2664 2769 2923 2591 2663 2478 2591 2643 2822 2665 2626 313

Accés públic

Mostra-ho tot

60 articles

2 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

John W. ByersProfessor of Computer Science, Boston UniversityCorreu electrònic verificat a cs.bu.edu
Andrei BroderDistinguished Scientist, GoogleCorreu electrònic verificat a google.com
Amin ShokrollahiEPFLCorreu electrònic verificat a epfl.ch
Daniel SpielmanProfessor of Computer Science, Yale UniversityCorreu electrònic verificat a yale.edu
Michael T. GoodrichProfessor of Computer Science, University of California, IrvineCorreu electrònic verificat a uci.edu
Justin ThalerGeorgetown UniversityCorreu electrònic verificat a georgetown.edu
Devavrat ShahMassachusetts Institute of TechnologyCorreu electrònic verificat a mit.edu
Georgios ZervasAssociate Professor of Marketing, Questrom School of Business, Boston UniversityCorreu electrònic verificat a bu.edu
Joe MarksCorreu electrònic verificat a ufa.ie
Michalis FaloutsosU. C. RiversideCorreu electrònic verificat a cs.ucr.edu
Marios IliofotouData Science & Engineering @ SplunkCorreu electrònic verificat a cs.ucr.edu
Muriel MedardProfessor of EECS, MITCorreu electrònic verificat a mit.edu
João BarrosCarnegie Mellon UniversityCorreu electrònic verificat a andrew.cmu.edu
Moses CharikarProfessor of Computer Science, Stanford UniversityCorreu electrònic verificat a cs.stanford.edu
Marc NajorkGoogle DeepMindCorreu electrònic verificat a google.com
Andrea W. RichaPresident's Professor, Arizona State UniversityCorreu electrònic verificat a asu.edu
S MuthukrishnanRutgers UnivCorreu electrònic verificat a cs.rutgers.edu

Segueix

Michael Mitzenmacher

Professor of Computer Science, Harvard University

Correu electrònic verificat a eecs.harvard.edu

Randomized Algorithms Internet Algorithms Networking Information Theory


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis M Mitzenmacher, E Upfal Cambridge university press, 2017	4570	2017
Detecting novel associations in large data sets DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ... science 334 (6062), 1518-1524, 2011	3410	2011
Network applications of bloom filters: A survey A Broder, M Mitzenmacher Internet mathematics 1 (4), 485-509, 2004	2496	2004
A brief history of generative models for power law and lognormal distributions M Mitzenmacher Internet mathematics 1 (2), 226-251, 2004	2379	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	1916	1998
The power of two choices in randomized load balancing M Mitzenmacher IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001	1711	2001
Privacy preserving keyword searches on remote encrypted data YC Chang, M Mitzenmacher International conference on applied cryptography and network security, 442-455, 2005	1637	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	1525	1998
Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001	1431	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	1296	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	1199	1997
Compressed bloom filters M Mitzenmacher Proceedings of the twentieth annual ACM symposium on Principles of …, 2001	1055	2001
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	964	2014
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	732	2002
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	537	2001
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	533	2006
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	499	1998
Analysis of Random Processes via And-Or Tree Evaluation. M Luby, M Mitzenmacher, MA Shokrollahi SODA 98, 364-373, 1998	481	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	476	1999

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors