Sorting-Based Selection Algorithms for Hypercubic Networks (1993) [15 citations — 3 self]
Download:
|
|
by A. Ferreira, B. M. Maggs, S. Perennes, C. G. Plaxton
In Proceedings of the 7th International Parallel Processing Symposium
http://www.cs.utexas.edu/users/plaxton/html/../ps/1993/ipps.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Ferreira93sorting-basedselection,author = {A. Ferreira and B. M. Maggs and S. Perennes and C. G. Plaxton},
title = {Sorting-Based Selection Algorithms for Hypercubic Networks},
booktitle = {In Proceedings of the 7th International Parallel Processing Symposium},
year = {1993},
pages = {89--95},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Abstract:
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based on the selection algorithm of Cole and Yap, as well as on various sorting algorithms for hypercubic networks. Our fastest algorithm runs in O(lg n lg n) time, very nearly matching the trivial \Omega\Gammavi n) lower bound. Previously, the best upper bound known for selection was O(lg n lg lg n). 1
Citations
| 1206 | Introduction to Parallel Algorithms and Architectures: Arrays – Leighton - 1992 |
| 281 | Expected time bounds for selection – Floyd, Rivest - 1975 |
| 98 | Parallelism in comparison problems – Valiant - 1975 |
| 77 | Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related – Cypher, Plaxton - 1990 |
| 74 | Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network – Nassimi, Sahni - 1982 |
| 56 | Optimal bounds for decision problems on the CRCW PRAM – Beame, Hastad - 1989 |
| 28 | Efficient Computation on Sparse Interconnection Networks – Plaxton - 1989 |
| 16 | An optimal parallel algorithm for selection – Vishkin - 1987 |
| 15 | A parallel median algorithm – Cole, Yap - 1985 |
| 8 | Deterministic selection in O(log log n) parallel time – Ajtai, Koml'os, et al. - 1986 |
| 5 | An optimally efficient parallel selection algorithm – Cole - 1988 |
| 2 | An optimal selection algorithm – Cole - 1986 |
