Probabilistic analysis of multiple quick select

DOI10.1007/PL00009241zbMath0914.68049OpenAlexW1997773225MaRDI QIDQ1277384

Robert T. Smythe, Hosam M. Mahmoud

Publication date: 2 February 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009241

zbMATH Keywords

MULTIPLE QUICK SELECT

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (8)

Distribution of distances in random binary search trees. ⋮ QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find ⋮ Attribute grammars and automatic complexity analysis ⋮ Analysis of multiple quickselect variants. ⋮ Analysis of the expected number of bit comparisons required by quickselect ⋮ Random minimal directed spanning trees and Dickman-type distributions ⋮ Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization ⋮ Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect

This page was built for publication: Probabilistic analysis of multiple quick select