Michael Mitzenmacher

Navedeno

	Vse	Od leta 2018
Navedbe	45835	14161
indeks h	88	49
indeks i10	251	161

3000

1500

750

2250

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023128 251 389 557 734 994 1266 1449 1554 1635 1897 2173 2112 2311 2571 2659 2720 2905 2606 2657 2487 2531 2632 2776 1068

Javni dostop

Prikaži vse

55 člankov

3 članki

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
George VargheseProfessor of Computer Science, University of California, Los AngelesPreverjeni e-poštni naslov na cs.ucla.edu
Justin ThalerGeorgetown UniversityPreverjeni e-poštni naslov na georgetown.edu
Georgios ZervasAssociate Professor of Marketing, Questrom School of Business, Boston UniversityPreverjeni e-poštni naslov na bu.edu
Devavrat ShahMassachusetts Institute of TechnologyPreverjeni e-poštni naslov na mit.edu
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 BarrosUniversidade do PortoPreverjeni e-poštni naslov na fe.up.pt
Moses CharikarProfessor of Computer Science, Stanford UniversityPreverjeni e-poštni naslov na cs.stanford.edu
Joe MarksPreverjeni e-poštni naslov na ufa.ie
Marc NajorkGooglePreverjeni 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	3978	2017
Detecting novel associations in large data sets DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ... science 334 (6062), 1518-1524, 2011	2706	2011
Network applications of bloom filters: A survey A Broder, M Mitzenmacher Internet mathematics 1 (4), 485-509, 2004	2334	2004
A brief history of generative models for power law and lognormal distributions M Mitzenmacher Internet mathematics 1 (2), 226-251, 2004	2257	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	1866	1998
The power of two choices in randomized load balancing M Mitzenmacher IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001	1535	2001
Privacy preserving keyword searches on remote encrypted data YC Chang, M Mitzenmacher ACNS 5 (3531), 442-455, 2005	1509	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	1420	1998
Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001	1383	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	1269	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	1177	1997
Compressed bloom filters M Mitzenmacher Proceedings of the twentieth annual ACM symposium on Principles of …, 2001	999	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	726	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	710	2002
Network applications of bloom filters: A survey A Broder Allerton Conference, 2002, 2002	646	2002
The power of two random choices: A survey of techniques and results R Sitaraman	507	2001
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	494	1998
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	477	2006
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	475	1999
Analysis of Random Processes via And-Or Tree Evaluation. M Luby, M Mitzenmacher, MA Shokrollahi SODA 98, 364-373, 1998	470	1998

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