On the lower bound for minimum comparison selection

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1976 (MFCS 1976)

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

  • 137 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum M., Floyd R. W., Pratt V., Rivest R., and Tarjan R., Time bounds for selection. JCSS 7 (Aug. 1973), 448–461

    Google Scholar 

  2. Hyafil L., Bounds for selection. IRIA. Rapport de Recherche no 77. 1974

    Google Scholar 

  3. Knuth D. E., The art of computer programming. Volume 3. Sorting and Searching. Addison — Wesley publishing company. 1973

    Google Scholar 

  4. Pratt V. and Yao F. F., On lower bounds for computing the i-th largest elements. Proceedings of the Fourteenth Symposium on Switching and Automata Theory, 1973

    Google Scholar 

  5. Ružička P., Wiedermann J., Algorithms of partial ordering. Technical Report CRC Bratislava, June 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ružička, P., Wiedermarm, J. (1976). On the lower bound for minimum comparison selection. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_220

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_220

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Navigation