Hoare's Selection Algorithm: A Markov Chain Approach
From MaRDI portal
Recommendations
Cited in
(17)- Mixed Poisson approximation of node depth distributions in random binary search trees
- Stability of perpetuities
- Almost sure convergence to the quicksort process
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- Density functions for \texttt{QuickQuant} and \texttt{QuickVal}
- On the number of iterations required by von Neumann addition
- Distributional convergence for the number of symbol comparisons used by QuickSelect
- Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find
- On the median-of-k version of Hoare's selection algorithm
- All solutions of the stochastic fixed point equation of the Quicksort process
- Statistical aspects of perpetuities
- Renorming divergent perpetuities
- Automated tail bound analysis for probabilistic recurrence relations
- Convergence of the QuickVal residual
- Exponential bounds for the running time of a selection algorithm
- Distributional analysis of swaps in quick select
This page was built for publication: Hoare's Selection Algorithm: A Markov Chain Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393823)
