Cover Image

Nearly Optimal List Labeling

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bender, Michael A., Conway, Alex, Farach-Colton, Martín, Komlós, Hanna, Koucký, Michal, Kuszmaul, William, Saks, Michael
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Layered List Labeling
by: Bender, Michael A., et al.
Published: (2024)

Optimal Bounds for Open Addressing Without Reordering
by: Farach-Colton, Martin, et al.
Published: (2025)

Almost Linear Size Edit Distance Sketch
by: Koucký, Michal, et al.
Published: (2024)

A Nearly Quadratic Improvement for Memory Reallocation
by: Farach-Colton, Martin, et al.
Published: (2024)

The Case for External Graph Sketching
by: Bender, Michael A., et al.
Published: (2025)

Bounding the Fragmentation of B-Trees Subject to Batched Insertions
by: Bender, Michael A., et al.
Published: (2026)

Time To Replace Your Filter: How Maplets Simplify System Design
by: Bender, Michael A., et al.
Published: (2025)

Optimal Non-Oblivious Open Addressing
by: Bender, Michael A., et al.
Published: (2025)

Tight Bounds for Classical Open Addressing
by: Bender, Michael A., et al.
Published: (2024)

Adaptive Quotient Filters
by: Wen, Richard, et al.
Published: (2024)

History-Independent Load Balancing
by: Bender, Michael A., et al.
Published: (2026)

SquareSort: a cache-oblivious sorting algorithm
by: Koucký, Michal, et al.
Published: (2024)

Fingerprint Filters Are Optimal
by: Kuszmaul, William, et al.
Published: (2025)

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
by: Kuszmaul, William, et al.
Published: (2025)

History-Independent Concurrent Hash Tables
by: Attiya, Hagit, et al.
Published: (2025)

Online List Labeling with Near-Logarithmic Writes
by: Seybold, Martin P.
Published: (2024)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
by: Kuszmaul, William
Published: (2025)

Scheduling Jobs with Work-Inefficient Parallel Solutions
by: Kuszmaul, William, et al.
Published: (2024)

The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
by: Kuszmaul, William, et al.
Published: (2021)

Tight Analyses of Ordered and Unordered Linear Probing
by: Braverman, Mark, et al.
Published: (2025)

Many Flavors of Edit Distance
by: Bhattacharya, Sudatta, et al.
Published: (2024)

Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)

Static Retrieval Revisited: To Optimality and Beyond
by: Hu, Yang, et al.
Published: (2025)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
by: Kuszmaul, William, et al.
Published: (2025)

Transposition is Nearly Optimal for IID List Update
by: Coester, Christian
Published: (2026)

Fast Concurrent Primitives Despite Contention
by: Bender, Michael A., et al.
Published: (2026)

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
by: Bhanja, Koustav, et al.
Published: (2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
by: Kuszmaul, William, et al.
Published: (2024)

Frontier Space-Time Algorithms Using Only Full Memory
by: Chmel, Petr, et al.
Published: (2026)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
by: Dudeja, Aditi, et al.
Published: (2024)

Local Enumeration: The Not-All-Equal Case
by: Gurumukhani, Mohit, et al.
Published: (2025)

Deterministic $k$-Median Clustering in Near-Optimal Time
by: Costa, Martín, et al.
Published: (2025)

Preprocessed 3SUM for Unknown Universes with Subquadratic Space
by: Kirkpatrick, Yael, et al.
Published: (2026)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
by: Dalirrooyfard, Mina, et al.
Published: (2023)

Near-Optimal Algorithms for Omniprediction
by: Okoroafor, Princewill, et al.
Published: (2025)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
by: Bhattacharya, Sayan, et al.
Published: (2024)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
by: Bishnu, Arijit, et al.
Published: (2024)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
by: Opler, Michal
Published: (2024)

Optimal Distance Labeling for Permutation Graphs
by: Gawrychowski, Paweł, et al.
Published: (2024)

Nearly Optimal Internal Dictionary Matching
by: Chen, Jingbang, et al.
Published: (2023)