1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computeralgorithms. Addison Wesley, Reading, MA 1974.
2. G. Brassard and P. Bratley. Fundamentals of Algorithmics. Prentice-Hall, Englewood Cliffs, NJ 1996.
3. S. Battiato, D. Cantone, D. Catalano, G. Cincotti, and M. Hofri. An Efficient Algorithm for the Approximate Median Selection Problem. Technical Report WPICS-TR-99-26, Worcester Polytechnic Institute, October 1999. Available from http:/ftp://ftp.cs.wpi.edu/pub/techreports/99-26.ps.gz.
4. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R. Tarjan. Time bounds for selection. Journal of Computer and Systems Sciences, 7(4):448–461, 1973.
5. S. Carlsson, M. Sundstrom. Linear-time In-place Selection in Less than 3n Comparisons-Division of Computer Science, Lulea University of Technology, S-971 87 LULEA, Sweden.