Almost sure convergence to the quicksort process
From MaRDI portal
Publication:2196368
Recommendations
Cites work
- scientific article; zbMATH DE number 193012 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- scientific article; zbMATH DE number 3410334 (Why is no real title available?)
- A characterization of the set of fixed points of the quicksort transformation
- A fixed point theorem for distributions
- A limit theorem for “quicksort”
- A limiting distribution for quicksort
- Analysis of Hoare's FIND algorithm with Median-of-three partition
- Asymptotic distribution theory for Hoare's selection algorithm
- Hoare's Selection Algorithm: A Markov Chain Approach
- Optimal sampling strategies in Quicksort and Quickselect
- Partial Quicksort and Quickpartitionsort
- Quicksort
- Some asymptotic theory for the bootstrap
- The analysis of Find and versions of it
- The contraction method for recursive algorithms
- The quicksort process
This page was built for publication: Almost sure convergence to the quicksort process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196368)