Skip to main content
Springer Nature Link
Log in

Analysis and experimentation on list update algorithms

  • Session 10B: Algorithms
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Included in the following conference series:

  • 140 Accesses

Abstract

This paper addresses the problem of efficient successful and unsuccessful search in deterministic self-adjusting linear lists. We describe and analyze a new list update algorithm which is 2-competitive to a large class of optimal offline static adversaries when considering both successful and unsuccessful searches. Analysis of the new scheme shows that it has a lower bookkeeping cost as fewer data movement is required. Experiments are conducted to compare the performance of this new algorithm and other algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Frederickson. “Self-organizing heuristics for implicit data structures”, SIAM Journal on Computing, 13, 2 (1984) 277–291.

    Article  Google Scholar 

  2. L. Hui and C. Martel. “Unsuccessful search in self-adjusting data structures”, Journal of Algorithm, 15 (1993) 447–481.

    Article  MathSciNet  Google Scholar 

  3. L.C.K. Hui and C. Martel. Randomized Competitive Algorithms for Successful and Unsuccessful Search. In Proc. of the Fourth Annual International Symposium on Algorithms and Computation, 426–435, December 1993, Hong Kong.

    Google Scholar 

  4. L.C.K. Hui and C. Martel. Analysing Deletions in Competitive Self-adjusting Linear List Algorithms. In Proc. of the Fifth Annual International Symposium on Algorithms and Computation, 433–441, August 1994, Beijing, P.R. China.

    Google Scholar 

  5. D. Sleator and R. Tarjan. “Amortized efficiency of list update and paging rules”, Communications of the A.C.M., 28, 2 (1985) 202–208.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems and Computer Science, National University of Singapore, Republic of Singapore

    Lucas Chi-Kwong Hui & Kwok-Yan Lam

Authors
  1. Lucas Chi-Kwong Hui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kwok-Yan Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hui, L.CK., Lam, KY. (1995). Analysis and experimentation on list update algorithms. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030879

Download citation

  • DOI: https://doi.org/10.1007/BFb0030879

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics