Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12180
- Type
- D - Journal article
- DOI
-
10.1007/s00453-014-9953-x
- Title of journal
- Algorithmica: an international journal in computer science
- Article number
- -
- First page
- 485
- Volume
- 74
- Issue
- 1
- ISSN
- 0178-4617
- Open access status
- Out of scope for open access requirements
- Month of publication
- November
- Year of publication
- 2014
- 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
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper has shed light on the mystery of why dual pivoting is not as effective for selection as for sorting. Its techniques have been adopted by other researchers, for example in "An Extended Note on the Comparison-optimal Dual-Pivot Quickselect" (ANALCO 2017) and "On the Convergence of the Dual-Pivot Quicksort Process" (Open J. of Model. a. Sim., 2016). The authors built on the techniques in "Sesquickselect: One and a half pivots for cache-efficient selection" (ANALCO 2019), which is not REF returned.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -