scispace - formally typeset
M

Michael Mitzenmacher

Researcher at Harvard University

Publications -  434
Citations -  39329

Michael Mitzenmacher is an academic researcher from Harvard University. The author has contributed to research in topics: Hash function & Cuckoo hashing. The author has an hindex of 79, co-authored 422 publications receiving 36300 citations. Previous affiliations of Michael Mitzenmacher include University of Paris-Sud & International Computer Science Institute.

Papers
More filters
Book

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

TL;DR: Preface 1. Events and probability 2. Discrete random variables and expectation 3. Moments and deviations 4. Chernoff bounds 5. Balls, bins and random graphs 6. Probabilistic method 7. Markov chains and random walks 8. Continuous distributions and the Poisson process
Journal ArticleDOI

Detecting Novel Associations in Large Data Sets

TL;DR: A measure of dependence for two-variable relationships: the maximal information coefficient (MIC), which captures a wide range of associations both functional and not, and for functional relationships provides a score that roughly equals the coefficient of determination of the data relative to the regression function.
Journal ArticleDOI

Network Applications of Bloom Filters: A Survey

TL;DR: The aim of this paper is to survey the ways in which Bloom filters have been used and modified in a variety of network problems, with the aim of providing a unified mathematical and practical framework for understanding them and stimulating their use in future applications.
Journal ArticleDOI

A Brief History of Generative Models for Power Law and Lognormal Distributions

TL;DR: A rich and long history is found of how lognormal distributions have arisen as a possible alternative to power law distributions across many fields, focusing on underlying generative models that lead to these distributions.
Journal ArticleDOI

The power of two choices in randomized load balancing

TL;DR: This work uses a limiting, deterministic model representing the behavior as n/spl rarr//spl infin/ to approximate the behavior of finite systems and provides simulations that demonstrate that the method accurately predicts system behavior, even for relatively small systems.