Probabilistic analysis of multiple quick select
From MaRDI portal
Publication:1277384
Recommendations
- Analysis of quickselect : an algorithm for order statistics
- On the variance of quickselect
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Towards a realistic analysis of the QuickSelect algorithm
- Optimal selection of the most probable multinomial alternative
- A statistical view on exchanges in Quickselect
- Average-case analysis of moves in Quick Select
Cited in
(13)- Attribute grammars and automatic complexity analysis
- Analysis of multiple quickselect variants.
- Distribution of distances in random binary search trees.
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm
- Distributional convergence for the number of symbol comparisons used by QuickSelect
- Quickselect and the Dickman Function
- Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find
- Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization
- Random minimal directed spanning trees and Dickman-type distributions
- Analysis of quickselect : an algorithm for order statistics
- Average-case analysis of moves in Quick Select
- A statistical view on exchanges in Quickselect
This page was built for publication: Probabilistic analysis of multiple quick select
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277384)
