250 citations · 1.1k across the 76 of their papers we have counts for
Showing 2012 · cs.DSShow all
3 papers · 2 filters
cs.DS2012★ 1 cited
Balanced Allocations and Double Hashing
Michael Mitzenmacher
Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item , one generates two hash values and …
cs.DS2012★ 2 cited
Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets
Michael Mitzenmacher, George Varghese
Large data sets are increasingly common in cloud and virtualized environments. For example, transfers of multiple gigabytes are commonplace, as are replicated blocks of such sizes.…
cs.DS2012
Anonymous Card Shuffling and its Applications to Parallel Mixnets
Michael T. Goodrich, Michael Mitzenmacher
We study the question of how to shuffle cards when faced with an opponent who knows the initial position of all the cards {\em and} can track every card when permuted, {\em exc…