73 citations · 634 across the 97 of their papers we have counts for
5 papers · 2 filters
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.…
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
Michael T. Goodrich, Pawel Pszona
In this paper, we present a number of network-analysis algorithms in the external-memory model. We focus on methods for large naturally sparse graphs, that is, n-vertex graphs that…
External-Memory Multimaps
Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher +1
Many data structures support dictionaries, also known as maps or associative arrays, which store and manage a set of key-value pairs. A \emph{multimap} is generalization that allow…
Data-Oblivious External-Memory Algorithms for the Compaction, Selection, and Sorting of Outsourced Data
Michael T. Goodrich
We present data-oblivious algorithms in the external-memory model for compaction, selection, and sorting. Motivation for such problems comes from clients who use outsourced data st…
Invertible Bloom Lookup Tables
Michael T. Goodrich, Michael Mitzenmacher
We present a version of the Bloom filter data structure that supports not only the insertion, deletion, and lookup of key-value pairs, but also allows a complete listing of its con…