Optimal Partitioning for Dual Pivot Quicksort

DOI10.1007/978-3-642-39206-1_4MaRDI QIDQ5326548zbMATH OpenOpenAlexFDO

Authors Martin Aumüller, Martin Dietzfelbinger

Publication date 6 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39206-1_4

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Optimal partitioning for dual-pivot quicksort
• Dual-pivot quicksort: optimality, analysis and zeros of associated lattice paths
• An extended note on the comparison-optimal dual-pivot quickselect
• Multi-pivot quicksort: theory and experiments
• A parallel partition for enhanced parallel QuickSort
• DUAL PIVOT QUICKSORT
• Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
• Pivot sampling in dual-pivot quicksort: exploiting asymmetries in Yaroslavskiy's partitioning scheme
• Average case and distributional analysis of dual-pivot quicksort

Cited in

(17)

• Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
• Pivot sampling in dual-pivot quicksort: exploiting asymmetries in Yaroslavskiy's partitioning scheme
• Average case analysis of Java 7's dual pivot quicksort
• Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
• DUAL PIVOT QUICKSORT
• BlockQuicksort: avoiding branch mispredictions in Quicksort
• Counting zeros in random walks on the integers and analysis of optimal dual-pivot quicksort
• Average case and distributional analysis of dual-pivot quicksort
• Optimal partitioning for dual-pivot quicksort
• How good is multi-pivot quicksort?
• An extended note on the comparison-optimal dual-pivot quickselect
• Probabilistic analysis of the dual-pivot quicksort ``Count
• Quicksort is optimal for many equal keys
• Dual-pivot quicksort: optimality, analysis and zeros of associated lattice paths
• Multi-pivot quicksort: theory and experiments
• Simple and fast BlockQuicksort using Lomuto's partitioning scheme
• Algorithms – ESA 2004

This page was built for publication: Optimal Partitioning for Dual Pivot Quicksort

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