Radix Sorting with No Extra Space

DOI10.1007/978-3-540-75520-3_19zbMath1151.68391OpenAlexW1864523757MaRDI QIDQ3527212

No author found.

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_19

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (11)

Optimal In-place Algorithms for Basic Graph Problems ⋮ What is a sorting function? ⋮ On the succinct representation of equivalence classes ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ On Wavelet Tree Construction ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Minimax trees in linear time with applications ⋮ Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Partial sums on the ultra-wide word RAM

This page was built for publication: Radix Sorting with No Extra Space