activity
20182026
most citedIceberg Hashing: Optimizing Many Hash-Table Criteria at Once

4 citations · 7 across the 14 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Tiny Pointers

Michael A. Bender, Alex Conway, Martín Farach-Colton +2

This paper introduces a new data-structural object that we call the tiny pointer. In many applications, traditional -bit pointers can be replaced with -bit ti…

cs.DS2021★ 4 cited

Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once

Michael A. Bender, Alex Conway, Martín Farach-Colton +2

Despite being one of the oldest data structures in computer science, hash tables continue to be the focus of a great deal of both theoretical and empirical research. A central reas…