Recommendations
Cites work
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- A locality-preserving cache-oblivious dynamic dictionary
- A Tight Lower Bound for Online Monotonic List Labeling
- Cache-Oblivious B-Trees
- scientific article; zbMATH DE number 2119642 (Why is no real title available?)
- Lower bounds for monotonic list labeling
- Minimal on-line labelling
- New bounds for the controller problem
- On Online Labeling with Polynomially Many Labels
- On randomized online labeling with polynomially many labels
- Tight lower bounds for the online labeling problem
- Tight lower bounds for the online labeling problem
Cited in
(9)- Online labeling: algorithms, lower bounds and open questions
- On Online Labeling with Polynomially Many Labels
- Tight lower bounds for the online labeling problem
- A tight lower bound for on-line monotonic list labeling
- A Tight Lower Bound for Online Monotonic List Labeling
- On randomized online labeling with polynomially many labels
- Tight lower bounds for the online labeling problem
- Online list labeling: breaking the ^2n barrier
- Minimal on-line labelling
This page was built for publication: On online labeling with large label set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232147)
