Deterministic sorting in O(n log log n) time and linear space

Journal of Algorithms

Volumn 50, Issue 1, 2004, Pages 96-105

  Han, Yijie ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Algorithms; Integer sorting; Linear space; Sorting; Time complexity

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; RANDOM PROCESSES; SORTING; TIME SERIES ANALYSIS;

DETERMINISTIC SORTING ALGORITHM; INTEGER SORTING; LINEAR SPACE; TIME COMPLEXITY;

ALGORITHMS;

EID: 0346640464     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2003.09.001     Document Type: Article

References (15)

1. S. Albers, T. Hagerup, Improved parallel integer sorting without concurrent writing, Inform. and Comput. 136 (1997) 25-51.
2. A. Andersson, Fast deterministic sorting and searching in linear space, in: Proc. 1996 IEEE Symp. on Foundations of Computer Science, 1996, pp. 135-141.
3. A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in linear time?, in: Proc. 1995 Symposium on Theory of Computing, 1995, pp. 427-436.
4. P. van Emde Boas, R. Kaas, E. Zijlstra, Design and implementation of an efficient priority queue, Math. Syst. Theory 10 (1977) 99-127.
5. M. Dietzfelbinger, T. Hagerup, J. Katajainen, M. Penttonen, A reliable randomized algorithm for the closest-pair problem, J. Algorithms 25 (1997) 19-51.
6. M.L. Fredman, D.E. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47 (1994) 424-436.
7. T. Hagerup, H. Shen, Improved nonconservative sequential and parallel integer sorting, Inform. Process. Lett. 36 (1990) 57-63.
8. Y. Han, Improved fast integer sorting in linear space, Inform. and Comput. 170 (1) (2001) 81-94.
9. Y. Han, M. Thorup, Sorting integers in O(n√loglogn) expected time and linear space, in: Proc. 2002 IEEE Symposium on Foundations of Computer Science (FOCS'02), 2002, pp. 135-144.
10. Y. Han, X. Shen, Conservative algorithms for parallel and sequential integer sorting, in: Proc. 1995 International Computing and Combinatorics Conference, in: Lecture Notes in Comput. Sci., Vol. 959, 1995, pp. 324-333.
11. D. Kirkpatrick, S. Reisch, Upper bounds for sorting integers on random access machines, Theoret. Comput. Sci. 28 (1984) 263-276.
12. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Kaufmann, San Mateo, CA, 1992.
13. R. Raman, Priority queues: small, monotone and trans-dichotomous, in: Proc. 1996 European Symp. on Algorithms, in: Lecture Notes in Comput. Sci., Vol. 1136, 1996, pp. 121-137.
14. M. Thorup, Fast deterministic sorting and priority queues in linear space, in: Proc. 1998 ACM-SIAM Symp. on Discrete Algorithms (SODA'98), 1998, pp. 550-555.
15. M. Thorup, Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations, in: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA'97), 1997, pp. 352-359.