Michael Mitzenmacher

Citirano

	Sve	Od 2019.
Citati	50091	15604
H-indeks	91	52
i10-indeks	273	178

3000

1500

750

2250

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024262 375 564 711 1017 1276 1441 1563 1652 1896 2150 2126 2307 2582 2659 2770 2924 2583 2667 2477 2582 2635 2815 2650 2426

Javni pristup

Prikaži sve

59 članaka

2 članka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

John W. ByersProfessor of Computer Science, Boston UniversityPotvrđena adresa e-pošte na cs.bu.edu
Andrei BroderDistinguished Scientist, GooglePotvrđena adresa e-pošte na google.com
Amin ShokrollahiEPFLPotvrđena adresa e-pošte na epfl.ch
Daniel SpielmanProfessor of Computer Science, Yale UniversityPotvrđena adresa e-pošte na yale.edu
Michael T. GoodrichProfessor of Computer Science, University of California, IrvinePotvrđena adresa e-pošte na uci.edu
Justin ThalerGeorgetown UniversityPotvrđena adresa e-pošte na georgetown.edu
Devavrat ShahMassachusetts Institute of TechnologyPotvrđena adresa e-pošte na mit.edu
Georgios ZervasAssociate Professor of Marketing, Questrom School of Business, Boston UniversityPotvrđena adresa e-pošte na bu.edu
Joe MarksPotvrđena adresa e-pošte na ufa.ie
Michalis FaloutsosU. C. RiversidePotvrđena adresa e-pošte na cs.ucr.edu
Marios IliofotouData Scientists & Engineer @ Splunk>Potvrđena adresa e-pošte na cs.ucr.edu
Muriel MedardProfessor of EECS, MITPotvrđena adresa e-pošte na mit.edu
João BarrosCarnegie Mellon UniversityPotvrđena adresa e-pošte na andrew.cmu.edu
Moses CharikarProfessor of Computer Science, Stanford UniversityPotvrđena adresa e-pošte na cs.stanford.edu
Marc NajorkGoogle DeepMindPotvrđena adresa e-pošte na google.com
Andrea W. RichaPresident's Professor, Arizona State UniversityPotvrđena adresa e-pošte na asu.edu
S MuthukrishnanRutgers UnivPotvrđena adresa e-pošte na cs.rutgers.edu

Prati

Michael Mitzenmacher

Professor of Computer Science, Harvard University

Potvrđena adresa e-pošte na eecs.harvard.edu

Randomized Algorithms Internet Algorithms Networking Information Theory


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis M Mitzenmacher, E Upfal Cambridge university press, 2017	4504	2017
Detecting novel associations in large data sets DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ... science 334 (6062), 1518-1524, 2011	3320	2011
Network applications of bloom filters: A survey A Broder, M Mitzenmacher Internet mathematics 1 (4), 485-509, 2004	2487	2004
A brief history of generative models for power law and lognormal distributions M Mitzenmacher Internet mathematics 1 (2), 226-251, 2004	2359	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	1913	1998
The power of two choices in randomized load balancing M Mitzenmacher IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001	1694	2001
Privacy preserving keyword searches on remote encrypted data YC Chang, M Mitzenmacher International conference on applied cryptography and network security, 442-455, 2005	1623	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	1508	1998
Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001	1426	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	1199	1997
Compressed bloom filters M Mitzenmacher Proceedings of the twentieth annual ACM symposium on Principles of …, 2001	1052	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	937	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	730	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	536	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	530	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	497	1998
Analysis of Random Processes via And-Or Tree Evaluation. M Luby, M Mitzenmacher, MA Shokrollahi SODA 98, 364-373, 1998	480	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

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori