Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. A. V. Aho, J. E. Hopocroft, and J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.
2. S. G. Akl: The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs, New Jersey, 1989.
3. M. D. Atkinson, J.-R. Sack, N. Santoro, and Th. Strothotte: Min-max heaps and generalized priority queues. Communications of the ACM 29 (10) (1986), 996–1000.
4. Y. Azar and N. Pippenger: Parallel selection. Discrete Applied Mathematics 27 (1–2) (1990), 49–58.
5. 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 (4) (1973), 448–461.