Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
Author:
- Mikkel ThorupMTMikkel Thorup
- 28 February 2002
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 42 (2) , 205-230
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A new efficient radix sort2002
- Sorting in Linear Time?Journal of Computer and System Sciences, 1998
- Improved Parallel Integer Sorting without Concurrent WritingInformation and Computation, 1997
- Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower BoundsBRICS Report Series, 1997
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsJournal of Computer and System Sciences, 1994
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- Bounded ordered dictionaries in O(log log N) time and O(n) spaceInformation Processing Letters, 1990
- Optimal bounds for decision problems on the CRCW PRAMJournal of the ACM, 1989
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- A note on two problems in connexion with graphsNumerische Mathematik, 1959