Faster deterministic sorting and priority queues in linear space

The RAM complexity of deterministic linear space sorting of integers in words is improved from O(n p logn) to O(n(log logn) 2 ). No better bounds are known for polynomial space. In fact, the techniques give a deterministic linear space priority queue supporting insert and delete in O((log logn) 2 ) amortized time and nd-min in constant time. The priority queue can be implemented using addition, shift, and bit-wise boolean operations.

[1]  Arne Andersson.  Faster deterministic sorting and searching in linear space , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[2]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[3]  Mikkel Thorup.  Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations , 1997, SODA '97.

[4]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[5]  Mikkel Thorup,et al.  On RAM priority queues , 1996, SODA '96.

[6]  Peter Bro Miltersen,et al.  Static dictionaries on AC/sup 0/ RAMs: query time /spl theta/(/spl radic/log n/log log n) is necessary and sufficient , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[7]  Rajeev Raman,et al.  Priority Queues: Small, Monotone and Trans-dichotomous , 1996, ESA.

[8]  Susanne Albers,et al.  Improved parallel integer sorting without concurrent writing , 1992, SODA '92.

[9]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[10]  Arne AnderssonLund Universityarne.  Static Dictionaries on Ac 0 Rams: Query Time ( R Log N= Log Log N) Is Necessary and Suucient , 1996 .

[11]  Peter Bro Miltersen.  Lower bounds for union-split-find related problems on random access machines , 1994, STOC '94.

[12]  Peter Bro Miltersen,et al.  Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds , 1997, WADS.