1 citations · 2 across the 5 of their papers we have counts for
5 papers
Nearly Optimal List Labeling
Michael A. Bender, Alex Conway, Martín Farach-Colton +4
The list-labeling problem captures the basic task of storing a dynamically changing set of up to elements in sorted order in an array of size . The goal is to…
Layered List Labeling
Michael A. Bender, Alex Conway, Martin Farach-Colton +2
The list-labeling problem is one of the most basic and well-studied algorithmic primitives in data structures, with an extensive literature spanning upper bounds, lower bounds, and…
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 $…
A New Approach to Enumerating Statistics Modulo
William Kuszmaul
We find a new approach to computing the remainder of a polynomial modulo ; such a computation is called modular enumeration. Given a polynomial with coefficients from a comm…
New Results on Doubly Adjacent Pattern-Replacement Equivalences
William Kuszmaul
In this paper, we consider the family of pattern-replacement equivalence relations referred to as the "indices and values adjacent" case. Each such equivalence is determined by a p…