Abstract
Maintaining a monotonic labeling of an ordered list during the insertion of n items requires Ω(n log n) individual relabelings, in the worst case, if the number of usable labels is only polynomial in n. This follows from a lower bound for a new problem, prefix bucketing.
Cite
CITATION STYLE
APA
Dietz, P. F., Seiferas, J. I., & Zhang, J. (1994). A tight lower bound for on-line monotonic list labeling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 824 LNCS, pp. 131–142). Springer Verlag. https://doi.org/10.1007/3-540-58218-5_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free