Layered List Labeling

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 data management applications. The classical algorithm for this problem, dating back to 1981, has amortized cost \(O(\lo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-04
Hauptverfasser:	Bender, Michael A, Conway, Alex, Farach-Colton, Martin, Komlos, Hanna, Kuszmaul, William
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Data management Data structures Labeling Lower bounds Upper bounds Workload Workloads
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!