#### Filter Results:

- Full text PDF available (94)

#### Publication Year

1994

2019

- This year (17)
- Last 5 years (66)
- Last 10 years (147)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

A Bloom lter is an ingenious randomized data-structure for concisely representing a set in order to support approximate membership queries. The space eÆciency is achieved at the cost of a small… (More)

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

Identifying interesting relationships between pairs of variables in large data sets is increasingly important. Here, we present a measure of dependence for two-variable relationships: the maximal… (More)

- Michael Luby, Michael Mitzenmacher, Amir H. Shokrollahi, Daniel A. Spielman
- IEEE Trans. Information Theory
- 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… (More)

- Michael Mitzenmacher
- IEEE Trans. Parallel Distrib. Syst.
- 2001

ÐWe consider the following natural model: Customers arrive as a Poisson stream of rate n, < 1, at a collection of n servers. Each customer chooses some constant d servers independently and uniformly… (More)

- John W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege
- SIGCOMM
- 1998

The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. We describe an ideal,… (More)

- Yan-Cheng Chang, Michael Mitzenmacher
- IACR Cryptology ePrint Archive
- 2004

We consider the following problem: a user U wants to store his files in an encrypted form on a remote file server S. Later the user U wants to efficiently retrieve some of the encrypted files… (More)

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

- Michael Mitzenmacher
- IEEE/ACM Trans. Netw.
- 2002

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications… (More)

- Michael Mitzenmacher
- Internet Mathematics
- 2003

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… (More)