Preview
Unable to display preview. Download preview PDF.
References
Blum M., Floyd R. W., Pratt V., Rivest R., and Tarjan R., Time bounds for selection. JCSS 7 (Aug. 1973), 448–461
Hyafil L., Bounds for selection. IRIA. Rapport de Recherche no 77. 1974
Knuth D. E., The art of computer programming. Volume 3. Sorting and Searching. Addison — Wesley publishing company. 1973
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
Ružička P., Wiedermann J., Algorithms of partial ordering. Technical Report CRC Bratislava, June 1976.
Author information
Authors and Affiliations
Editor information
Rights 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