Bibliographic Details
| Title: |
A TIGHT LOWER BOUND FOR ONLINE MONOTONIC LIST LABELING. |
| Authors: |
Dietz, Paul F.1 dietz@stc.corp.mot.com, Seiferas, Joel I.2 joel@cs.rochester.edu, Zhang, Ju3 ju.zhang@jpmchase.com |
| Source: |
SIAM Journal on Discrete Mathematics. 2005, Vol. 18 Issue 3, p626-637. 12p. |
| Subject Terms: |
*Boundary value problems, *Online data processing, *Internet, *Internet programming, *Mathematical analysis, *Numerical analysis, *Polynomials, *Calculus, *Algebra, *Computer software |
| 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. [ABSTRACT FROM AUTHOR] |
| Database: |
Academic Search Index |