Skip to main content
SpringerLink
Log in

Implicit selection

  • Conference paper
  • First Online:
SWAT 88 (SWAT 1988)

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

Included in the following conference series:

Abstract

We consider the implicit selection problem, in which we want to select the kth smallest element of a multiset of n elements using only a constant amount of additional space. We show that this problem can be solved in O(n) time in the worst case. In particular, we show that 6.7756n+o(n) comparisons are sufficient if all elements are distinct and 6.8280n+o(n) comparisons are sufficient in the general case.

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. S. W. Bent and J. W. John. Finding the median requires 2n comparisons. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 213–216, 1985.

    Google Scholar 

  2. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448–461, 1973.

    Google Scholar 

  3. R. W. Floyd and R. L. Rivest. Expected time bounds for selection. Communications of the ACM, 18:165–172, 1975.

    Google Scholar 

  4. L. R. Ford and S. M. Johnson. A tournament problem. American Mathematical Monthly, 66:387–389, 1959.

    Google Scholar 

  5. E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms, pages 131–135. Computer Science Press, 1978.

    Google Scholar 

  6. T. W. Lai. Space Bounds for Selection. Master's thesis, University of Waterloo, 1987.

    Google Scholar 

  7. J. I. Munro. An implicit data structure supporting insertion, deletion, and search in O (log2 n) time. Journal of Computer and System Sciences, 33:66–74, 1986.

    Google Scholar 

  8. J. I. Munro and H. Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21:236–250, 1980.

    Google Scholar 

  9. A. Schönhage, M. Paterson, and N. Pippenger. Finding the median. Journal of Computer and System Sciences, 13:184–199, 1976.

    Google Scholar 

  10. J. van Leeuwen and D. Wood. Interval heaps. Technical Report, Univ. of Waterloo, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Data Structuring Group Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Tony W. Lai & Derick Wood

Authors
  1. Tony W. Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Derick Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf Karlsson Andrzej Lingas

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lai, T.W., Wood, D. (1988). Implicit selection. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-19487-8_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39288-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation