Michael Mitzenmacher

Citata da

	Tutte	Dal 2019
Citazioni	49598	15159
Indice H	91	52
i10-index	272	176

3000

1500

750

2250

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024262 374 563 711 1017 1275 1441 1562 1650 1896 2152 2130 2303 2579 2659 2768 2927 2581 2665 2474 2580 2622 2794 2643 2029

Accesso pubblico

Visualizza tutto

59 articoli

2 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

John W. ByersProfessor of Computer Science, Boston UniversityEmail verificata su cs.bu.edu
Andrei BroderDistinguished Scientist, GoogleEmail verificata su google.com
Amin ShokrollahiEPFLEmail verificata su epfl.ch
Daniel SpielmanProfessor of Computer Science, Yale UniversityEmail verificata su yale.edu
Michael T. GoodrichProfessor of Computer Science, University of California, IrvineEmail verificata su uci.edu
Justin ThalerGeorgetown UniversityEmail verificata su georgetown.edu
Devavrat ShahMassachusetts Institute of TechnologyEmail verificata su mit.edu
Georgios ZervasAssociate Professor of Marketing, Questrom School of Business, Boston UniversityEmail verificata su bu.edu
Michalis FaloutsosU. C. RiversideEmail verificata su cs.ucr.edu
Marios IliofotouData Scientists & Engineer @ Splunk>Email verificata su cs.ucr.edu
Joe MarksEmail verificata su ufa.ie
Muriel MedardProfessor of EECS, MITEmail verificata su mit.edu
João BarrosCarnegie Mellon UniversityEmail verificata su andrew.cmu.edu
Moses CharikarProfessor of Computer Science, Stanford UniversityEmail verificata su cs.stanford.edu
Marc NajorkGoogle DeepMindEmail verificata su google.com
Andrea W. RichaPresident's Professor, Arizona State UniversityEmail verificata su asu.edu
S MuthukrishnanRutgers UnivEmail verificata su cs.rutgers.edu

Segui

Michael Mitzenmacher

Professor of Computer Science, Harvard University

Email verificata su eecs.harvard.edu

Randomized Algorithms Internet Algorithms Networking Information Theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis M Mitzenmacher, E Upfal Cambridge university press, 2017	4437	2017
Detecting novel associations in large data sets DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ... science 334 (6062), 1518-1524, 2011	3233	2011
Network applications of bloom filters: A survey A Broder, M Mitzenmacher Internet mathematics 1 (4), 485-509, 2004	2472	2004
A brief history of generative models for power law and lognormal distributions M Mitzenmacher Internet mathematics 1 (2), 226-251, 2004	2345	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	1909	1998
The power of two choices in randomized load balancing M Mitzenmacher IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001	1673	2001
Privacy preserving keyword searches on remote encrypted data YC Chang, M Mitzenmacher International conference on applied cryptography and network security, 442-455, 2005	1604	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	1495	1998
Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001	1419	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	1291	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	1195	1997
Compressed bloom filters M Mitzenmacher Proceedings of the twentieth annual ACM symposium on Principles of …, 2001	1046	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	922	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	731	2002
Network applications of bloom filters: A survey A Broder Allerton Conference, 2002, 2002	641	2002
The power of two random choices: A survey of techniques and results R Sitaraman	535	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	526	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	496	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

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori