Minimal on-line labelling
From MaRDI portal
Publication:845889
DOI10.1016/J.IPL.2006.07.011zbMATH Open1185.68879OpenAlexW2073667726MaRDI QIDQ845889FDOQ845889
Authors: 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
Recommendations
- Minimum point-overlap labelling*
- Towards minimal barcodes
- Minimal coding
- Minimal accessible categories
- Tight lower bounds for the online labeling problem
- Tight lower bounds for the online labeling problem
- Minimum point-overlap labeling
- On online labeling with large label set
- Minimal concept identification and reliability
- scientific article; zbMATH DE number 7364985
Cites Work
- A Tight Lower Bound for Online Monotonic List Labeling
- Monads for incremental computing
- Approximate Indexed Lists
- A new method for functional arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast updating of well-balanced trees
- A tight lower bound for on-line monotonic list labeling
- Adaptive functional programming
Cited In (3)
This page was built for publication: Minimal on-line labelling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845889)