Lower bounds for monotonic list labeling

DOI10.1007/3-540-52846-6_87zbMath1502.68096OpenAlexW1518873433MaRDI QIDQ5056101

Ju Zhang, Paul F. Dietz

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_87

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (5)

Binary search trees: How low can you go? ⋮ A tight lower bound for on-line monotonic list labeling ⋮ Canonical density control ⋮ Tight Lower Bounds for the Online Labeling Problem ⋮ On Online Labeling with Large Label Set

Cites Work

• Maintaining order in a generalized linked list
• Making data structures persistent
• Controlled density sorting
• Amortized Computational Complexity
• Padded Lists Revisited
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds for monotonic list labeling