Fast Deterministic Selection

DOI10.4230/LIPIcs.SEA.2017.24zbMath1433.68109arXiv1606.00484OpenAlexW2963762572MaRDI QIDQ4580181

Andrei Alexandrescu

Publication date: 13 August 2018

Full work available at URL: https://arxiv.org/abs/1606.00484

zbMATH Keywords

selection problemQuickselectalgorithm engineeringalgorithmic librariesmedian of medians

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (8)

On a Reduction for a Class of Resource Allocation Problems ⋮ A fast algorithm for quadratic resource allocation problems with nested constraints ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ Unnamed Item ⋮ Finding a mediocre player ⋮ MedianOfNinthers ⋮ A selectable sloppy heap ⋮ Selection Algorithms with Small Groups

Uses Software

• GitHub

This page was built for publication: Fast Deterministic Selection