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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1997, Pages 352-359

  Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; RANDOM ACCESS STORAGE; RANDOM PROCESSES; THEOREM PROVING;

BITWISE BOOLEAN OPERATIONS; RANDOMIZED SORTING ALGORITHMS;

SORTING;

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

References (15)