Integer sorting in O(n√log log n) expected time and linear space

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 135-144

  Han, Yijie ^a   Thorup, Mikkel ^b  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM ACCESS STORAGE; RANDOM PROCESSES; RECURSIVE FUNCTIONS; SET THEORY; THEOREM PROVING;

INTEGER SORTING; RANDOMIZED ALGORITHM SORTING; STRING SORTING;

SORTING;

EID: 0036954324     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3(1):1-19, 1983.
2. S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writing. Inf. Comput., 136:25-51, 1997.
3. A. Andersson. Sublogarithmic searching without multiplications. In Proc. 36th FOCS, 655-663, 1995.
4. A. Andersson. Faster deterministic sorting and searching in linear space. In Proc. 37th FOCS, pages 135-141, 1996.
5. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in linear time? J. Comp. Syst. Sc., 57:74-93, 1998. Announced at STOC'95.
6. 0 instructions only. Theor. Comput. Sc., 215(1-2):337-344, 1999.
7. A. Andersson and S. Nilsson. A new efficient radix sort. In Proc. 35th FOCS, pages 714-721, 1994.
8. A. Andersson and M. Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proc. 32nd STOC, pages 335-342, 2000.
9. P. Beame and F. Fich. Optimal bounds for the predecessor problem. In Proc. 31st STOC, pages 295-304, 1999.
10. P. Beame and J. Håstad. Optimal bounds for decision problems on the CRCW PRAM. J. ACM, 36(3):643-670, 1989.
11. J. Bentley. Programming Pearls. Addison-Wesley, Reading, Massachusetts, 1986.
12. A. Brodnik, P. B. Miltersen, and I. Munro. Transdichotomous algorithms without multiplication - some upper and lower bounds. In Proc. 5th WADS, LNCS 1272, pages 426-439, 1997.
13. B. Cherkassky, A. Goldberg, and C. Silverstein. Buckets, heaps, lists, and monotone priority queues. SIAM J. Comp., 28(4):1326-1346, 1999.
14. L. J. Comrie. The hollerith and powers tabulating machines. Trans. Office Machinary Users' Assoc., Ltd, pages 25-37, 1929-30.
15. S. Cook and R. Reckhow. Time-bounded random access machines. J. Comp. Syst. Sc., 10(2):217-255, 1973.
16. A. I. Dumey. Indexing for rapid random access memory systems. Computers and Automation, 5(12):6-9, 1956.
17. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci., 47:424-436, 1993. Announced at STOC'90.
18. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci., 48:533-551, 1994.
19. T. Hagerup. Sorting and searching on the word RAM. In Proc. 15th STACS, LNCS 1373, pages 366-398, 1998.
20. Y. Han. Fast integer sorting in linear space. In Proc. STACS'00, LNCS 1170, pages 242-253, 2000.
21. Y. Han. Improved fast integer sorting in linear space. Inf. Comput., 170(8):81-94, 2001. Announced at STACS'00 and SODA'01.
22. Y. Han. Deterministic sorting in O(n log log n) time and linear space. In Proc. 34th STOC, 2002.
23. Y. Han and X. Shen. Conservative algorithms for parallel and sequential integer sorting. In Proc. 1st COCOON, LNCS 959, pages 324-333, 1995.
24. Y. Han and X. Shen. Parallel integer sorting is more efficient than parallel comparison sorting onm exclusive write PRAMs. In Proc. 10th SODA, pages 419-428, 1999.
25. IEEE. Standard for binary floating-point arithmetic. ACM Sigplan Notices, 22:9-25, 1985.
26. B. Kernighan and D. Ritchie. The C Programming Language. Prentice Hall, second edition, 1988.
27. D. Kirkpatrick and S. Reisch. Upper bounds for sorting integers on random access machines. Theor. Comp. Sc., 28:263-276, 1984.
28. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, second edition, 1998.
29. S. Nilsson. Radix Sorting & Searching. Ph.D. Thesis, Lund University, Sweden, 1996.
30. W. Paul and J. Simon. Decision trees and random access machines. In Proc. Symp. über Logik and Algoritmik, pages 331-340, 1980.
31. R. Raman. Priority queues: small, monotone and transdichotomous. In Proc. 4th ESA, LNCS 1136, pages 121-137, 1996.
32. B. Stroustrup. The C++ Programming Language, Special Edition, Addison-Wesley, Reading, MA, 2000.
33. M. Thorup. Faster deterministic sorting and priority queues in linear space. In Proc. 9th SODA, pages 550-555, 1998.
34. M. Thorup. On RAM priority queues. SIAM J. Comp., 30(1):86-109, 2000.
35. M. Thorup. Equivalence between priority queues and sorting, 2002. Also submitted to FOCS'02.
36. M. Thorup. Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations. J. Algor., 42(2):205-230, 2002. Announced at SODA'97.
37. P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In Proc. 16th FOCS, pages 75-84, 1975.