17 citations · 40 across the 6 of their papers we have counts for
6 papers
Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps
Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher +1
A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key-value store that allows for multiple values to be associated with the same key.…
Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation
Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko +1
We study the problem of providing privacy-preserving access to an outsourced honest-but-curious data repository for a group of trusted users. We show that such privacy-preserving d…
Cuckoo Hashing with Pages
Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink
Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many sett…
Hierarchical Heavy Hitters with the Space Saving Algorithm
Michael Mitzenmacher, Thomas Steinke, Justin Thaler
The Hierarchical Heavy Hitters problem extends the notion of frequent items to data arranged in a hierarchy. This problem has applications to network traffic monitoring, anomaly de…
On the Zero-Error Capacity Threshold for Deletion Channels
Ian A. Kash, Michael Mitzenmacher, Justin Thaler +1
We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook consisting of strings of bits, and our mod…
Interfacing network coding with TCP: an implementation
Jay Kumar Sundararajan, Szymon Jakubczak, Muriel Medard +2
In previous work (`Network coding meets TCP') we proposed a new protocol that interfaces network coding with TCP by means of a coding layer between TCP and IP. Unlike the usual bat…