Efficient selection on a binary tree☆
References (6)
An optimal algorithm for parallel selection
Inform. Process. Lett.
(1984)A comparative study of X-tree, pyramid and related machines
- et al.
Time bounds for selection
J. Comput. System Sci.
(1972)
There are more references available in the full text version of this article.
Cited by (6)
Optimal binary search trees
1997, Theoretical Computer ScienceAn efficient selection algorithm on the pyramid
1995, Information Processing LettersOptically Interconnected Processor Arrays with Switching Capability
1994, Journal of Parallel and Distributed ComputingOn the bit complexity of parallel computations
1988, Integration, the VLSI JournalEmbedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses
1994, IEEE Transactions on Parallel and Distributed SystemsA Nonsorting Vlsi Structure for Implementing the (M, L) Algorithm
1988, IEEE Journal on Selected Areas in Communications
- ☆
This work was supported by the Natural Sciences and Engineering Research Council of Canada under Grant A-3336.
Copyright © 1986 Published by Elsevier B.V.