# M. Mitzenmacher

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Detecting Novel Associations in Large Data Sets

- David N. Reshef, Yakir A Reshef, +6 authors Pardis C Sabeti
- Biology, Computer Science
- Science
- 1 December 2011

A statistical method reveals relationships among variables in complex data sets. Identifying interesting relationships between pairs of variables in large data sets is increasingly important. Here,… Expand

Network Applications of Bloom Filters: A Survey

- A. Broder, M. Mitzenmacher
- Computer Science
- Internet Math.
- 1 January 2004

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters allow false positives but the space savings often… Expand

The Power of Two Choices in Randomized Load Balancing

- M. Mitzenmacher
- Computer Science
- IEEE Trans. Parallel Distrib. Syst.
- 1 October 2001

We consider the following natural model: customers arrive as a Poisson stream of rate /spl lambda/n, /spl lambda/<1, at a collection of n servers. Each customer chooses some constant d servers… Expand

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

- M. Mitzenmacher
- Computer Science, Mathematics
- Internet Math.
- 1 January 2004

Recently, I became interested in a current debate over whether file size distributions are best modelled by a power law distribution or a lognormal distribution. In trying to learn enough about these… Expand

Efficient erasure correcting codes

- M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman
- Computer Science, Mathematics
- IEEE Trans. Inf. Theory
- 1 February 2001

We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a… Expand

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

- M. Mitzenmacher, E. Upfal
- Computer Science, Mathematics
- 2005

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. The probabilistic method 7. Markov… Expand

Min-Wise Independent Permutations

- A. Broder, M. Charikar, A. Frieze, M. Mitzenmacher
- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 1 June 2000

We define and study the notion of min-wise independent families of permutations. We say that F?Sn (the symmetric group) is min-wise independent if for any set X?n and any x?X, when ? is chosen at… Expand

Cuckoo Filter: Practically Better Than Bloom

- B. Fan, D. Andersen, M. Kaminsky, M. Mitzenmacher
- Computer Science
- CoNEXT '14
- 2 December 2014

In many networking systems, Bloom filters are used for high-speed set membership tests. They permit a small fraction of false positive answers with very good space efficiency. However, they do not… Expand

Privacy Preserving Keyword Searches on Remote Encrypted Data

- Yan-Cheng Chang, M. Mitzenmacher
- Computer Science
- ACNS
- 7 June 2005

We consider the following problem: a user $\mathcal{U}$ wants to store his files in an encrypted form on a remote file server $\mathcal{S}$. Later the user $\mathcal{U}$ wants to efficiently retrieve… Expand

Practical loss-resilient codes

- M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, V. Stemann
- Computer Science
- STOC '97
- 4 May 1997

We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encod-ing and decoding algorithms for… Expand