Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 1998: Algorithm Theory — SWAT'98 pp 131–142Cite as

Improved upper bounds for time-space tradeoffs for selection with limited storage

  • Conference paper
  • First Online:

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

Abstract

We consider the problem of finding an element of a given rank in a totally ordered set given in a read-only array, using limited extra storage cells. We give new algorithms for various ranges of extra space. Our upper bounds improve the previously known bounds in the range of space s such that s is o(lg2 n) and s ≥ clg lg n/lg lg lg n for some constant c. We also give faster algorithms to find small ranks.

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. R. J. Cole, An optimally efficient selection algorithm, Information Processing Letters 26 (6) (1988) 295–299.

    Article  MATH  MathSciNet  Google Scholar 

  2. G. N. Frederickson, Upper bounds for time-space trade-offs in sorting and selection, Journal of Computer and System Sciences 34 (1987) 19–26.

    Article  MATH  MathSciNet  Google Scholar 

  3. J. I. Munro and M. S. Paterson, Selection and sorting with limited storage, Theoretical Computer Science 12 (1980) 315–325.

    Article  MathSciNet  Google Scholar 

  4. J. I. Munro and V. Raman, Selection from read-only memory and sorting with minimum data movement, Theoretical Computer Science 165 (1996) 311–323.

    Article  MathSciNet  Google Scholar 

  5. V. Raman and S. Ramnath, “Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage”, TR98/04/17, Institute of Mathematical Sciences, Chennai, India.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Mathematical Sciences, 600 113, Chennai, India

    Venkatesh Raman

  2. Department of Computer Science, St Cloud State University, 720, 4th ave S., 56303, St Cloud, MN

    Sarnath Ramnath

Authors
  1. Venkatesh Raman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sarnath Ramnath
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefan Arnborg Lars Ivansson

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raman, V., Ramnath, S. (1998). Improved upper bounds for time-space tradeoffs for selection with limited storage. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054361

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64682-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation