Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths

DOI10.1017/S096354831800041XzbMath1432.68108arXiv1611.00258MaRDI QIDQ5219324

Martin Dietzfelbinger, Prodinger, Helmut, Daniel Krenn, Clemens Heuberger, Martin Aumüller

Publication date: 11 March 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

The vectorial kernel method for walks with longer steps ⋮ Some Double Sums Involving Ratios of Binomial Coefficients Arising From Urn Models

Uses Software

• SIGMA
• OEIS
• EvaluateMultiSums
• Quicksort
• Asymptotic Expansions

Cites Work

• Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
• Symbolic summation assists combinatorics
• Average Case Analysis of Java 7’s Dual Pivot Quicksort
• Lattice Path Enumeration
• 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?
• Quicksort
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths