Adaptive sampling strategies for quickselects

DOI10.1145/1798596.1798606MaRDI QIDQ2930336zbMATH OpenOpenAlexWikidataFDO

Authors Conrado Martínez, Daniel Panario, Alfredo Viola

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 analysisquickselectdivide-and-conqueranalytic combinatorics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6469176
• Optimal sampling strategies in Quicksort and Quickselect
• On the variance of quickselect
• Optimal sampling strategies for quicksort
• Analysis of multiple quickselect variants.

Cited in

(8)

• Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
• scientific article; zbMATH DE number 6469176 (Why is no real title available?)
• On the variance of quickselect
• Optimal sampling strategies for quicksort
• Optimal sampling strategies in Quicksort and Quickselect
• BlockQuicksort: avoiding branch mispredictions in Quicksort
• The analysis of range quickselect and related problems
• Selection by rank in K-dimensional binary search trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930336)