10 citations · 21 across the 3 of their papers we have counts for
3 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.…
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…