Advertisement

A tight lower bound for on-line monotonic list labeling

  • Paul F. Dietz
  • Joel I. Seiferas
  • Ju Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 824)

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.

Keywords

Insertion Point Dense Point Computing Machinery Label Problem Item Bucket 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AL90]
    Andersson, A., Lai, T. W.: Fast updating of well-balanced trees. In: SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory, Proceedings. (Lecture Notes in Computer Science, vol. 447.) Springer, New York Berlin Heidelberg, 1990, pp. 111–121Google Scholar
  2. [Di82]
    Dietz, P. F.: Maintaining order in a linked list. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, 1982, pp. 122–127Google Scholar
  3. [DS87]
    Dietz, P. F., Sleator, D. D.: Two algorithms for maintaining order in a list. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, 1987, pp. 365–372 (revision to appear in Journal of Computer and System Sciences)Google Scholar
  4. [DSZ94]
    Dietz, P. F., Seiferas, J. I., Zhang, J.: Lower bounds for smooth list labeling, (in preparation)Google Scholar
  5. [DZ90]
    Dietz, P. F., Zhang, J.: Lower bounds for monotonie list labeling. In: SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory, Proceedings. (Lecture Notes in Computer Science, vol. 447.) Springer, New York Berlin Heidelberg, 1990, pp. 173–180Google Scholar
  6. [HS66]
    Hennie, F. C., Stearns, R. E.: Two-tape simulation of multitape Turing machines. Journal of the Association for Computing Machinery 13 (1966) 533–546Google Scholar
  7. [IKR81]
    Itai, A., Konheim, A. G., Rodeh, M.: A sparse table implementation of sorted sets. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, Research Report RC 9146, 1981Google Scholar
  8. [Ts84]
    Tsakalidis, A. K.: Maintaining order in a generalized linked list. Acta Informatica 21 (1984) 101–112CrossRefGoogle Scholar
  9. [Zh93]
    Zhang, J.: Density control and on-line labeling problems. Computer Science Department, University of Rochester, Rochester, New York, Technical Report 481 and Ph. D. Thesis, 1993Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Paul F. Dietz
    • 1
  • Joel I. Seiferas
    • 1
  • Ju Zhang
    • 2
  1. 1.Computer Science DepartmentUniversity of RochesterRochesterUSA
  2. 2.Consumer Asset ManagementChemical BankNew YorkUSA

Personalised recommendations