Skip to main content
SpringerLink
Log in

Time and space bounds for selection problems

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1978)

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

Included in the following conference series:

Abstract

The complexity of a number of selection problems is considered. An algorithm is given to determine the mode of a multiset in a number of comparisons differing from the lower bound by only a "lower order term." The problems of finding the kth largest element in a set in minimal and near minimal space are also discussed. A time space tradeoff is demonstrated for these problems.

Portions of this research were supported by the National Research Council under Grant A8237 and the National Science Foundation under Grant MCS76-11460.

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.

6. References

  1. B. Allen, "On Binary Search Trees," Research Report CS-77-27, Department of Computer Science, University of Waterloo.

    Google Scholar 

  2. Bayer, P. J., "Improved Bounds of the Costs of Optimal and Balanced Binary Search Trees," Project MAC Technical Memorandum 69, M.I.T., November 1975.

    Google Scholar 

  3. Blum, M. Floyd, R., Pratt, V., Rivest, R., and Tarjan, R., "Time Bounds for Selection," JCSS 7(1973), pp. 448–461.

    Google Scholar 

  4. Dobkin, D., and Munro, I., "A Minimal Space Selection Algorithm that Runs in Linear Time,’ Proc. Johns Hopkins CISS Conference April 1977. Also appears as Yale Department of Computer Science Technical Report #106.

    Google Scholar 

  5. Hwang, F. K. and Lin, S., "A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets," SICOMP 1,1(March 1972), pp. 31–39.

    Google Scholar 

  6. Munro, I. and Spira, P., "Sorting and Searching in Multisets," SICOMP 5,1 (March 1976), pp. 1–9.

    Google Scholar 

  7. Pohl, I., "A Minimum Storage Algorithm for Computing the Median", IBM Technical Report RC2701, November 1969.

    Google Scholar 

  8. Pratt, V., and Yao, F., "On Lower Bounds for Computing the ith Largest Element," Proc. 14th IEEE Symposium on SWAT, October 1973, pp. 70–81.

    Google Scholar 

  9. Rivest, R. and Floyd, R., "Bounds on the Expected Time for Median Computations," in Combinatorial Algorithms ed. R. Rustin, Courant C. S. Symposium 9, Algorithmics Press 1973, see also Rivest and Floyd "Algorithm 488 (Select) CACM 18(1975), p. 173.

    Google Scholar 

  10. Schonage, A. Paterson, M. and Pippenger, N., "Finding the Median," JCSS 13 (1976), pp. 184–199.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yale University, USA

    David Dobkin

  2. University of Waterloo, USA

    J. Ian Munro

Authors
  1. David Dobkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Ian Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dobkin, D., Munro, J.I. (1978). Time and space bounds for selection problems. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation