Deterministic sorting in O(nloglogn) time and linear space
From MaRDI portal
Publication:4819696
DOI10.1016/j.jalgor.2003.09.001zbMath1106.68028OpenAlexW2049774319WikidataQ56066265 ScholiaQ56066265MaRDI QIDQ4819696
Publication date: 4 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2003.09.001
Related Items
Order-preserving indexing, A Linear Time Algorithm for Ordered Partition, Sorting Short Keys in Circuits of Size ${o(n \log n)}$, ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS, Construct a perfect word hash function in time independent of the size of integers, Optimizing binary heaps, On scheduling a single machine with resource dependent release times, Algorithms in the Ultra-Wide Word Model, Top-\(k\) document retrieval in optimal space, Substring complexities on run-length compressed strings, Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities, Fast computation of a longest increasing subsequence and application, On Faster Integer Calculations Using Non-arithmetic Primitives, Universal compressed text indexing, Efficient Computation of 2-Covers of a String., Value-at-Risk model for hazardous material transportation, A subquadratic algorithm for 3XOR, Substring range reporting, Constant-time sorting, Well-separated pair decomposition in linear time?, Dispersing hash functions, Unnamed Item, Integer priority queues with decrease key in constant time and the single source shortest paths problem, More Efficient Parallel Integer Sorting, Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space, Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC, Counting inversions adaptively
