4 citations · 8 across the 31 of their papers we have counts for
4 papers · 1 filter
IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity
Prashant Pandey, Michael A. Bender, Alex Conway +4
Modern hash table designs strive to minimize space while maximizing speed. The most important factor in speed is the number of cache lines accessed during updates and queries. This…
Tight Bounds for Monotone Minimal Perfect Hashing
Sepehr Assadi, Martin Farach-Colton, William Kuszmaul
The monotone minimal perfect hash function (MMPHF) problem is the following indexing problem. Given a set of distinct keys from a universe of size $…
Online List Labeling: Breaking the Barrier
Michael A. Bender, Alex Conway, Martín Farach-Colton +3
The online list labeling problem is an algorithmic primitive with a large literature of upper bounds, lower bounds, and applications. The goal is to store a dynamically-changing se…
What Does Dynamic Optimality Mean in External Memory?
Michael A. Bender, Martín Farach-Colton, William Kuszmaul
In this paper, we revisit the question of how the dynamic optimality of search trees should be defined in external memory. A defining characteristic of external-memory data structu…