A probabilistic analysis of the Floyd–Rivest expected time selection algorithm

DOI10.1080/00207160512331331048zbMATH Open1079.65014OpenAlexW2026619959MaRDI QIDQ5460565

C. J. Siniolakis, A. V. Gerbessiotis

Publication date: 18 July 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160512331331048

zbMATH Keywords

randomizationselection algorithmFloyd-Rivest algorithm

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Bootstrap, jackknife and other resampling methods (62F40) Statistical ranking and selection procedures (62F07)

Related Items (1)

Leveraging parameterized Chernoff bounds for simplified algorithm analyses

This page was built for publication: A probabilistic analysis of the Floyd–Rivest expected time selection algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460565)