On fluctuations of complexity measures for the FIND algorithm

DOI10.4230/LIPICS.AOFA.2024.9MaRDI QIDQ6865690zbMATH OpenFDO

Authors Jasper Ischebeck, Ralph Neininger

Publication date 30 January 2026

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

weak convergencefunctional limit theoremquickselectprobabilistic analysis of algorithmsrank selectionfind

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

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)