Michael Mitzenmacher

Navedeno

	Vse	Od leta 2019
Navedbe	50057	15572
indeks h	91	52
indeks i10	273	178

3000

1500

750

2250

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024262 377 564 711 1016 1276 1442 1563 1652 1898 2150 2127 2306 2582 2659 2770 2925 2583 2667 2478 2582 2633 2814 2653 2393

Javni dostop

Prikaži vse

59 člankov

2 članka

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

John W. ByersProfessor of Computer Science, Boston UniversityPreverjeni e-poštni naslov na cs.bu.edu
Andrei BroderDistinguished Scientist, GooglePreverjeni e-poštni naslov na google.com
Amin ShokrollahiEPFLPreverjeni e-poštni naslov na epfl.ch
Daniel SpielmanProfessor of Computer Science, Yale UniversityPreverjeni e-poštni naslov na yale.edu
Michael T. GoodrichProfessor of Computer Science, University of California, IrvinePreverjeni e-poštni naslov na uci.edu
Justin ThalerGeorgetown UniversityPreverjeni e-poštni naslov na georgetown.edu
Devavrat ShahMassachusetts Institute of TechnologyPreverjeni e-poštni naslov na mit.edu
Georgios ZervasAssociate Professor of Marketing, Questrom School of Business, Boston UniversityPreverjeni e-poštni naslov na bu.edu
Joe MarksPreverjeni e-poštni naslov na ufa.ie
Michalis FaloutsosU. C. RiversidePreverjeni e-poštni naslov na cs.ucr.edu
Marios IliofotouData Scientists & Engineer @ Splunk>Preverjeni e-poštni naslov na cs.ucr.edu
Muriel MedardProfessor of EECS, MITPreverjeni e-poštni naslov na mit.edu
João BarrosCarnegie Mellon UniversityPreverjeni e-poštni naslov na andrew.cmu.edu
Moses CharikarProfessor of Computer Science, Stanford UniversityPreverjeni e-poštni naslov na cs.stanford.edu
Marc NajorkGoogle DeepMindPreverjeni e-poštni naslov na google.com
Andrea W. RichaPresident's Professor, Arizona State UniversityPreverjeni e-poštni naslov na asu.edu
S MuthukrishnanRutgers UnivPreverjeni e-poštni naslov na cs.rutgers.edu

Spremljaj

Michael Mitzenmacher

Professor of Computer Science, Harvard University

Preverjeni e-poštni naslov na eecs.harvard.edu

Randomized Algorithms Internet Algorithms Networking Information Theory


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis M Mitzenmacher, E Upfal Cambridge university press, 2017	4498	2017
Detecting novel associations in large data sets DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ... science 334 (6062), 1518-1524, 2011	3308	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	2361	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	1911	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	1621	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	1425	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	1292	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	1197	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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji