Adaptive sampling strategies for quickselects

DOI10.1145/1798596.1798606zbMath1300.68022OpenAlexW2024781872WikidataQ61734790 ScholiaQ61734790MaRDI QIDQ2930336

Alfredo Viola, Daniel Panario, Conrado Martínez

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1798596.1798606

zbMATH Keywords

samplingselectionaverage-case analysisanalytic combinatoricsquickselectdivide-and-conquer

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

The analysis of range quickselect and related problems ⋮ BlockQuicksort ⋮ Selection by rank inK-dimensional binary search trees ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm

This page was built for publication: Adaptive sampling strategies for quickselects