Minimal on-line labelling

DOI10.1016/j.ipl.2006.07.011zbMath1185.68879OpenAlexW2073667726MaRDI QIDQ845889

Stefan Sadnicki, Richard S. Bird

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.07.011

zbMATH Keywords

algorithmscombinatorial problemsanalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05)

Related Items (2)

Tight Lower Bounds for the Online Labeling Problem ⋮ On Online Labeling with Large Label Set

Cites Work

• Unnamed Item
• Unnamed Item
• Monads for incremental computing
• Approximate Indexed Lists
• A new method for functional arrays
• Fast updating of well-balanced trees
• A tight lower bound for on-line monotonic list labeling
• Adaptive functional programming
• A Tight Lower Bound for Online Monotonic List Labeling

This page was built for publication: Minimal on-line labelling