An efficient selection algorithm on the pyramid
References (9)
- et al.
Efficient selection on a binary tree
Inform. Process. Lett.
(1986) A comparative study of X-tree, pyramid and related machines
Design and Analysis of Parallel Algorithms
(1989)- 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 (8)
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
2007, Information SciencesDistributed multiple selection algorithm for peer-to-peer systems
2005, Journal of Systems and SoftwareImage Analysis and Computer Vision: 1995
1996, Computer Vision and Image UnderstandingStatic range multiple selection algorithm for peer-to-peer system
2011, IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011Statistical fixed range multiple selection algorithm for peer-to-peer system
2010, ICCAIE 2010 - 2010 International Conference on Computer Applications and Industrial ElectronicsRevisit of statistical selection algorithm for peer-to-peer system
2008, Proceedings - International Symposium on Information Technology 2008, ITSim
Copyright © 1995 Published by Elsevier B.V.