A tight lower bound for on-line monotonic list labeling

DOI10.1007/3-540-58218-5_12zbMath1502.68095OpenAlexW1624393875MaRDI QIDQ5056172

Ju Zhang, Joel I. Seiferas, Paul F. Dietz

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_12

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

Binary search trees: How low can you go? ⋮ A tight lower bound for on-line monotonic list labeling ⋮ Minimal on-line labelling

Cites Work

• Maintaining order in a generalized linked list
• Fast updating of well-balanced trees
• Lower bounds for monotonic list labeling
• A tight lower bound for on-line monotonic list labeling
• Two-Tape Simulation of Multitape Turing Machines

This page was built for publication: A tight lower bound for on-line monotonic list labeling