{"ID":5936963,"CreatedAt":"2026-07-07T03:14:33.014478982Z","UpdatedAt":"2026-07-09T16:29:05.102679088Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2607.05302","arxiv_id":"2607.05302","title":"Parallel $\\mathcal O(\\sqrt n)$ Overhead LSD Radix Sort","abstract":"We present Radsort, a variant of LSD radix sort, sorting data with $\\mathcal O(\\sqrt n)$ additional space. Radsort is stable, admits a simple implementation and is easy to parallelise. For arrays exceeding a size of around 2 MiB it outperforms a conventional out-of-place LSD radix sort.","short_abstract":"We present Radsort, a variant of LSD radix sort, sorting data with $\\mathcal O(\\sqrt n)$ additional space. Radsort is stable, admits a simple implementation and is easy to parallelise. For arrays exceeding a size of around 2 MiB it outperforms a conventional out-of-place LSD radix sort.","url_abs":"https://arxiv.org/abs/2607.05302","url_pdf":"https://arxiv.org/pdf/2607.05302v1","authors":"[\"Robert Clausecker\",\"Florian Schintke\"]","published":"2026-07-06T16:44:52Z","proceeding":"cs.DS","tasks":"[\"cs.DS\",\"cs.DB\"]","methods":"[]","has_code":false}