Improved nonconservative sequential and parallel integer sorting
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
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
Improved parallel integer sorting without concurrent writing
Information and Computation
SODA '97 Proceedings of the eighth 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
Improved fast interger sorting in linear space
Information and Computation
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
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
ACM Transactions on Algorithms (TALG)
Voronoi diagrams in n · 2o(√lg lg n) time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient unbalanced merge-sort
Information Sciences: an International Journal
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Predecessor queries in constant time?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Research paper: The saga of minimum spanning trees
Computer Science Review
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
Compressed text indexing with wildcards
Journal of Discrete Algorithms
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in the range {0, 1, 2, &1dots;, m—1} in linear space in O(n log log n) time. This improves our previous result [8] which sorts in O(n log log n log log log n) time and linear space. This also improves previous best deterministic sorting algorithm [3, 11] which sorts in O(nlog log n) time but uses O(m&egr;) space. Our results can also be compared with Thorup's previous result [16] which sorts in O(nlog log n) time and linear space but uses randomization.