Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1993: Algorithms and Computation pp 426–435Cite as

Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists

  • Conference paper
  • First Online:

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

Abstract

This paper studies the classical Dictionary problem using a self-adjusting linear list. We design and analyze randomized, on-line algorithms for a sequence of successful and unsuccessful searches which are competitive with off-line algorithms. Our algorithms combine our ps bit technique which speeds up unsuccessful search with the randomized move-to-front scheme of Reingold, Westbrook, and Sleator, which they used to speed up successful search.

This work was supported by US National Science Foundation Grant CCR 90-23727

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Bentley and C. McGeoch. Worst-case analysis of self-organizing sequential search heuristics. In Proc. of 20th Allerton Conf. on Communication, Control, and Computing, pages 452–461, 1983.

    Google Scholar 

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

    Article  Google Scholar 

  3. L. Hui and C. Martel. On efficient unsuccessful search. In Proc. of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 217–227, 1992.

    Google Scholar 

  4. S. Irani, N. Reingold, J. Westbrook, and D. Sleator. Randomized competitive algorithms for the list update problem. In Proc. of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pages 251–260, 1991.

    Google Scholar 

  5. J. McCabe. On serial files with relocatable records. Oper. Res., 12:609–618, 1965.

    Google Scholar 

  6. N. Reingold, J. Westbrook, and D. Sleator. Randomized competitive algorithms for the list update problem. Algorithmica, to appear.

    Google Scholar 

  7. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Commun. of the A.C.M., 28(2):202–208, 1985.

    Google Scholar 

  8. D. Sleator and R. Tarjan. Self-adjusting binary search trees. J.A.C.M., 32(3):652–686, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Lucas Chi Kwong Hui

  2. Department of Computer Science, University of California, Davis, 95616, Davis, CA, USA

    Charles U. Martel

Authors
  1. Lucas Chi Kwong Hui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Charles U. Martel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hui, L.C.K., Martel, C.U. (1993). Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_274

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_274

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation