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
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
Optimal time-space trade-offs for non-comparison-based sorting
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Algorithms and theory of computation handbook
The growing-tree sorting algorithm
WSEAS Transactions on Information Science and Applications
| Hi-index | 0.00 |
We present improved fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in linear space in &Ogr;(n log log n log log log n) time. This improves the &Ogr;(n(log log n)3/2) time bound given in [6]. When the n integers in {0,1,…, m - 1} to be sorted satisfying log m ⪈(log n)2+∈, 0 &Ogr;(n log log n). These results are obtained by applying signature sorting on our previous result[6].