Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space

Authors:
Yijie Han;Mikkel Thorup
Affiliations:
-;-
Venue:
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Year:
2002

Citing 0
Cited 31

Integer priority queues with decrease key in constant time and the single source shortest paths problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Combinatorial power in multimedia processors

ACM SIGARCH Computer Architecture News
Deterministic sorting in O(nlog logn) time and linear space

Journal of Algorithms
Meldable RAM priority queues and minimum directed spanning trees

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs

Theoretical Computer Science - Special issue on automata, languages and programming
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Journal of Computer and System Sciences - Special issue: STOC 2003
Melding priority queues

ACM Transactions on Algorithms (TALG)
Tight bounds for dynamic convex hull queries (again)

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Voronoi diagrams in n · 2o(√lg lg n) time

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Equivalence between priority queues and sorting

Journal of the ACM (JACM)
Well-separated pair decomposition in linear time?

Information Processing Letters
Generic discrimination: sorting and paritioning unshared data in linear time

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Max-Coloring Paths: Tight Bounds and Extensions

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient unbalanced merge-sort

Information Sciences: an International Journal
Radix sorting with no extra space

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Data structures for range minimum queries in multidimensional arrays

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Counting inversions, offline orthogonal range counting, and related problems

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners

ACM Transactions on Algorithms (TALG)
Delaunay triangulations in O(sort(n)) time and more

Journal of the ACM (JACM)
Orthogonal range searching on the RAM, revisited

Proceedings of the twenty-seventh annual symposium on Computational geometry
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

ACM Transactions on Algorithms (TALG)
Self-Improving Algorithms

SIAM Journal on Computing
External string sorting: faster and cache-oblivious

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Persistent predecessor search and orthogonal point location on the word RAM

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast algorithms for the free riders problem in broadcast encryption

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The growing-tree sorting algorithm

WSEAS Transactions on Information Science and Applications
Research paper: The saga of minimum spanning trees

Computer Science Review
Max-coloring paths: tight bounds and extensions

Journal of Combinatorial Optimization
Rank-Pairing Heaps

SIAM Journal on Computing
Connectivity oracles for planar graphs

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a randomized algorithm sorting n integers in 0(n\sqrt {\log \log n}) expected time and linear space. This improves the previous O(n log log n) bound by Anderson et al. from STOC'95. As an immediate consequence, if the integers are bounded by U, we can sort them in 0(n\sqrt {\log \log U}) expected time. This is the first improvement over the O(n log log U) bound obtained with van Emde Boas' data structure from FOCS'75.At the heart of our construction, is a technical deterministic lemma of independent interest; namely, that we split n integers into subsets of size at most \sqrt nin linear time and space. This also implies improved bounds for deterministic string sorting and integer sorting without multiplication.