دنبال کردن
Michael Mitzenmacher
Michael Mitzenmacher
Professor of Computer Science, Harvard University
ایمیل تأیید شده در eecs.harvard.edu
عنوان
نقل شده توسط
نقل شده توسط
سال
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis‏
M Mitzenmacher, E Upfal‏
Cambridge university press, 2017‏
44942017
Detecting novel associations in large data sets‏
DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ...‏
science 334 (6062), 1518-1524, 2011‏
32982011
Network applications of bloom filters: A survey‏
A Broder, M Mitzenmacher‏
Internet mathematics 1 (4), 485-509, 2004‏
24842004
A brief history of generative models for power law and lognormal distributions‏
M Mitzenmacher‏
Internet mathematics 1 (2), 226-251, 2004‏
23572004
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‏
19121998
The power of two choices in randomized load balancing‏
M Mitzenmacher‏
IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001‏
16912001
Privacy preserving keyword searches on remote encrypted data‏
YC Chang, M Mitzenmacher‏
International conference on applied cryptography and network security, 442-455, 2005‏
16172005
Min-wise independent permutations‏
AZ Broder, M Charikar, AM Frieze, M Mitzenmacher‏
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998‏
15071998
Efficient erasure correcting codes‏
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman‏
IEEE Transactions on Information Theory 47 (2), 569-584, 2001‏
14252001
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‏
12922001
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‏
11981997
Compressed bloom filters‏
M Mitzenmacher‏
Proceedings of the twentieth annual ACM symposium on Principles of …, 2001‏
10512001
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‏
9322014
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‏
7312002
Network applications of bloom filters: A survey‏
A Broder‏
Allerton Conference, 2002, 2002‏
6422002
The power of two random choices: A survey of techniques and results‏
R Sitaraman‏
5362001
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‏
5292006
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‏
4971998
Analysis of Random Processes via And-Or Tree Evaluation.‏
M Luby, M Mitzenmacher, MA Shokrollahi‏
SODA 98, 364-373, 1998‏
4811998
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‏
4761999
سیستم در حال حاضر قادر به انجام عملکرد نیست. بعداً دوباره امتحان کنید.
مقاله‌ها 1–20