Deterministic sorting in O(n log log n) time and linear space

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 602-608

  Han, Yijie ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Algorithms; Integer sorting; Linear space; Sorting; Time complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; RANDOM PROCESSES; THEOREM PROVING; VECTORS;

DETERMINISTIC SORTING; INTEGER SORTING; LINEAR SPACE; TIME COMPLEXITY;

SORTING;

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

References (16)

1. Improved parallel integer sorting without concurrent writing
2. Fast deterministic sorting and searching in linear space
3. Sorting in linear time?
4. Design and implementation of an efficient priority queue
5. A reliable randomized algorithm for the closest-pair problem
6. Surpassing the information theoretic bound with fusion trees
7. Improved nonconservative sequential and parallel integer sorting
8. Improved fast integer sorting in linear space
9. East integer sorting in linear space
10. Sorting integers in O(n√log log n) expected time and linear space
11. Conservative algorithms for parallel and sequential integer sorting
12. Upper bounds for sorting integers on random access machines
13. Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes
14. Priority queues: Small, monotone and trans-dichotomous
15. Fast deterministic sorting and priority queues in linear space
16. Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations