On fluctuations of complexity measures for the FIND algorithm
From MaRDI portal
Cites work
- A Gaussian limit process for optimal FIND algorithms
- A note on the height of binary search trees
- Asymptotic distribution theory for Hoare's selection algorithm
- Distributional analysis of swaps in quick select
- Distributional convergence for the number of symbol comparisons used by QuickSelect
- Distributional convergence for the number of symbol comparisons used by QuickSort
- scientific article; zbMATH DE number 42857 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- Introduction to algorithms.
- On fluctuations of complexity measures for the FIND algorithm
- Process convergence for the complexity of radix selection on Markov sources
- Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find
- The height of a random binary search tree
- The number of bit comparisons used by quicksort: an average-case analysis
- The Number of Symbol Comparisons in QuickSort and QuickSelect
Cited in
(3)
This page was built for publication: On fluctuations of complexity measures for the FIND algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865690)
