Deterministic sorting in O ( n log log n ) time and linear space
From MaRDI portal
Publication:3579249
DOI10.1145/509907.509993zbMath1192.68196OpenAlexW1978715699MaRDI QIDQ3579249
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509993
Related Items (11)
A new approach to all-pairs shortest paths on real-weighted graphs ⋮ Order-preserving pattern matching with \(k\) mismatches ⋮ New method in information processing for maintaining an efficient dynamic ordered set ⋮ Compressed text indexing with wildcards ⋮ A simple reduction from maximum weight matching to maximum cardinality matching ⋮ The saga of minimum spanning trees ⋮ Lower Bounds for External Memory Integer Sorting via Network Coding ⋮ Efficient unbalanced merge-sort ⋮ Maximal common subsequence algorithms ⋮ A Survey on Priority Queues ⋮ RAM-Efficient External Memory Sorting
This page was built for publication: Deterministic sorting in O ( n log log n ) time and linear space
