Michael Mitzenmacher

Citirano

	Sve	Od 2017.
Citati	41995	13063
H-indeks	83	49
i10-indeks	234	156

3000

1500

750

2250

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022131 240 368 529 719 988 1245 1450 1541 1630 1897 2182 2102 2351 2557 2630 2700 2909 2580 2641 2512 2552 2621 152

Javni pristup

Prikaži sve

46 članaka

3 č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
George VargheseProfessor of Computer Science, University of California, Los AngelesPotvrđena adresa e-pošte na cs.ucla.edu
Justin ThalerGeorgetown UniversityPotvrđena adresa e-pošte na georgetown.edu
Georgios ZervasAssociate Professor of Marketing, Questrom School of Business, Boston UniversityPotvrđena adresa e-pošte na bu.edu
Devavrat ShahMassachusetts Institute of TechnologyPotvrđena adresa e-pošte na mit.edu
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 BarrosUniversidade do PortoPotvrđena adresa e-pošte na fe.up.pt
Moses CharikarProfessor of Computer Science, Stanford UniversityPotvrđena adresa e-pošte na cs.stanford.edu
Andrea W. RichaProfessor, Arizona State UniversityPotvrđena adresa e-pošte na asu.edu
Marc NajorkGooglePotvrđena adresa e-pošte na google.com
S MuthukrishnanRutgers UnivPotvrđena adresa e-pošte na cs.rutgers.edu

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	3596	2017
Network applications of bloom filters: A survey A Broder, M Mitzenmacher Internet mathematics 1 (4), 485-509, 2004	2191	2004
Detecting novel associations in large data sets DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ... science 334 (6062), 1518-1524, 2011	2141	2011
A brief history of generative models for power law and lognormal distributions M Mitzenmacher Internet mathematics 1 (2), 226-251, 2004	2135	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	1834	1998
Privacy preserving keyword searches on remote encrypted data YC Chang, M Mitzenmacher International conference on applied cryptography and network security, 442-455, 2005	1412	2005
The power of two choices in randomized load balancing M Mitzenmacher IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001	1405	2001
Min-wise independent permutations AZ Broder, M Charikar, AM Frieze, M Mitzenmacher Journal of Computer and System Sciences 60 (3), 630-659, 2000	1357	2000
Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001	1339	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	1217	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	1139	1997
Compressed bloom filters M Mitzenmacher IEEE/ACM transactions on networking 10 (5), 604-612, 2002	963	2002
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	701	2002
Network applications of bloom filters: A survey A Broder, M Mitzenmacher, ABIM Mitzenmacher Internet Mathematics, 2002	628	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	519	2014
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	473	1999
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	468	1998
Analysis of Random Processes via And-Or Tree Evaluation. M Luby, M Mitzenmacher, MA Shokrollahi SODA 98, 364-373, 1998	457	1998
The power of two random choices: A survey of techniques and results AW Richa, M Mitzenmacher, R Sitaraman Combinatorial Optimization 9, 255-304, 2001	452	2001
An improved construction for counting bloom filters F Bonomi, M Mitzenmacher, R Panigrahy, S Singh, G Varghese European Symposium on Algorithms, 684-695, 2006	439	2006

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

Slijedi ovog autora

Citirano

Suautori