Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)

DOI10.1007/978-3-319-08404-6_3zbMath1416.68061OpenAlexW2216436304MaRDI QIDQ3188879

Gerth Stølting Brodal, Jesper Sindahl Nielsen, Djamal Belazzougui

Publication date: 2 September 2014

Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08404-6_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (3)

A Linear Time Algorithm for Ordered Partition ⋮ Construct a perfect word hash function in time independent of the size of integers ⋮ Unnamed Item

This page was built for publication: Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)