Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise Boolean operations

Journal of Algorithms

Volumn 42, Issue 2, 2002, Pages 205-230

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Batched dictionaries; Priority queues; Sorting; Word RAM

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; GLOSSARIES; QUEUEING NETWORKS; RANDOM ACCESS STORAGE; RANDOM PROCESSES; SORTING;

BATCHED DICTIONARIES; PRIORITY QUEUES; RANDOMIZED SORTING;

ALGORITHMS;

EID: 0036488678     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2002.1211     Document Type: Article

References (25)

1. S. Albers and T. Hagerup, Improved parallel integer sorting without concurrent writing, Inform. and Control 136 (1997), 25-51.
2. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, Sorting in linear time? J. Comput. System Sci. 57 (1998), 74-93. STOC, ACM '95.
3. 0 RAMs: Query time Θ(√log n/ log log n) is necessary and sufficient, in "Proc. 37th FOCS, IEEE," pp. 441-450, 1996.
4. A. Andersson and S. Nilsson, A new efficient radix sort, in "Proc. 35th FOCS, IEEE," pp. 714-721, 1994.
5. P. Beame and J. Håstad, Optimal bounds for decision problems on the CRCW PRAM, J. Assoc. Comput. Mach. 36 (1989), 643-670.
6. A. Brodnik, P. B. Miltersen, and I. Munro, Trans-dichotomous algorithms without multiplication-some upper and lower bounds, in "Proc. 5th WADS," Lecture Notes in Computer Science, Vol. 1272, pp. 426-439, Springer-Verlag, Berlin/New York, 1997.
7. J. L. Carter and M. N. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979), 143-154.
8. M. Dietzfelbinger, Universal hashing and k-wise independent random variables via integer arithmetic without primes, in "Proc. 13th STACS," Lecture Notes in Computer Science, Vol. 1046, pp. 569-580, Springer-Verlag, Berlin/New York, 1996.
9. E. W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (1959), 269-271.
10. M. L. Fredman and D. E. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47 (1993), 424-436. STOC, ACM '90.
11. M. L. Fredman and D. E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. System Sci. 48 (1994), 533-551.
12. Intel, The IA-32 Intel Architecture Software Developer's Manual, Volume 2: Instruction Set Reference (Order Number 245471), 2001. Available at http://developer.intel.com/design/pentium4/manuals/245471.htm
13. K. Mehlhorn and S. Nähler, Bounded ordered dictionaries in O(log log n) time and O(n) space, Inform. Process. Lett. 35, 4 (1990), 183-189.
14. P. B. Miltersen, Lower bounds for static dictionaries on RAMs with bit operations but no multiplication, in "Proc. 23rd ICALP," Lecture Notes in Computer Science, Vol. 1099, pp. 442-453, Springer-Verlag, Berlin/New York, 1996.
15. S. Nilsson, "Radix Sorting & Searching," Ph.D. Thesis, Lund University, Sweden, 1996.
16. C. H. Papadimitriou, "Computational Complexity," Addison-Wesley, Reading, MA, 1994.
17. V. R. Pratt and L. J. Stockmeyer, A characterization of the power of vector machines, J. Comput. System Sci. 12 (1976), 198-221.
18. R. Raman, Priority queues: small, monotone and trans-dichotomous, in "Proc. 4th ESA," Lecture Notes in Computer Science, Vol. 1136, pp. 121-137, Springer-Verlag, Berlin New York, 1996.
19. A. Schönhage and V. Strassen, Schnelle multiplication großer zahlen, Computing 7 (1971), 281-292.
20. N. T. Slingerland and A. J. Smith, "Multimedia Instruction Sets for General Purpose Microprocessors: A Survey," Technical Report DCSD-00-1124, University of California, Berkeley, 2000.
21. 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 SODA, AMC-SIAM," pp. 352-359, 1997.
22. M. Thorup, On RAM priority queues, SIAM J. Comput. 30 (2000), 86-109.
23. W. Uhlman, Vergleich der hypergeometrischen mit der binomial verteilung, Metrika 10 (1966), 145-158.
24. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inform. Process Lett. 6 (1977), 80-82.
25. J. W. J. Williams, Heapsort, Comm. Assoc. Comput. Mach. 7 (1964), 347-348.