-
Michael David Mitzenmacher is an
American computer scientist working in algorithms. He is
Professor of
Computer Science at the
Harvard John A. Paulson...
-
Bonomi et al. (2006).
Dillinger &
Manolios (2004a);
Kirsch &
Mitzenmacher (2006).
Mitzenmacher &
Upfal (2005).
Blustein & El-Maazawi (2002), pp. 21–22 Gopinathan...
- understood.
Recent reviews of
generative processes for Zipf's law
include Mitzenmacher, "A
Brief History of
Generative Models for
Power Law and
Lognormal Distributions"...
-
performance compared against alternative hashing schemes. A
survey by
Mitzenmacher presents open
problems related to
cuckoo hashing as of 2009.
Cuckoo hashing...
- code
Byers et al. 1998.
Mitzenmacher 2004. Luby et al. 1997. Luby,
Mitzenmacher &
Shokrollahi 1998.
Byers JW, Luby M,
Mitzenmacher M, Rege A (October 1998)...
- (1991)
prove MaxSNP-completeness.
Mitzenmacher &
Upfal (2005), Sect. 6.2.
Motwani &
Raghavan (1995), Sect. 5.1.
Mitzenmacher &
Upfal (2005), Sect. 6.3. Khuller...
- Kučera, Jan; Basat, Ran Ben; ****a, Mário; Antichi, Gianni; Yu, Minlan;
Mitzenmacher,
Michael (2020-11-23), "Detecting
routing loops in the data plane", Proceedings...
- Microeconomics. 2 (1): 58–85. ISSN 1945-7669. JSTOR 25760376.
Michael Mitzenmacher; Eli
Upfal (2005),
Probability and computing:
randomized algorithms and...
- Theory. New York, NJ, US: John
Wiley & Sons. ISBN 978-0-471-03262-5.
Mitzenmacher,
Michael (2017).
Probability and computing:
Randomization and probabilistic...
- journal}}: CS1 maint:
multiple names:
authors list (link) Kirsch, A;
Mitzenmacher, M; Pietracaprina, A; Pucci, G; Upfal, E; Vandin, F (June 2012). "An...
