Average Case and Distributional Analysis of Dual-Pivot Quicksort
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12179
- Type
- D - Journal article
- DOI
-
10.1145/2629340
- Title of journal
- ACM Transactions on Algorithms
- Article number
- 22
- First page
- 3
- Volume
- 11
- Issue
- 3
- ISSN
- 1549-6325
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This article extends "Average-Case Analysis of Java 7’s Dual-Pivot Quicksort" (ESA 2012, winner of the Best Paper Award) with many original results (Bytecode counts, variance, limit distributions). Its techniques have been adopted by other researchers, for example in "Optimal partitioning for dual-pivot quicksort" (TALG 2016), "Probabilistic Analysis of the Dual-Pivot Quicksort “Count”" (ANALCO 2018), and "Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths" (Combinatorics, Probability and Computing 2019).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -