An optimally efficient selection algorithm
Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improved parallel integer sorting without concurrent writing
Information and Computation
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Faster deterministic sorting and priority queues in linear space
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Conservative Algorithms for Parallel and Sequential Integer Sorting
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in linear space in O(n(log log n)1:5) time. This improves the O(n(log log n)2) time bound given in [11]. This result is obtained by combining our new technique with that of Thorup's[11]. The approach and technique we provide are totally different from previous approaches and techniques for the problem. As a consequence our technique can be extended to apply to nonconservative sorting and parallel sorting. Our nonconservative sorting algorithm sorts n integers in {0, 1,...,m-1} in time O(n(log log n)2/(log k+log log log n)) using word length k log(m + n), where k ≤ log n. Our EREW parallel algorithm sorts n integers in {0, 1, ...,m -1} in O((log n)2) time and O(n(log log n)2/log log log n) operations provided log m =Ω((log n)2).