On the probabilistic worst-case time of ``find
From MaRDI portal
Publication:5953102
DOI10.1007/s00453-001-0046-2zbMath1021.68030MaRDI QIDQ5953102
Publication date: 14 January 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0046-2
68P10: Searching and sorting
Related Items
On stochastic recursive equations of sum and max type, Stochastic recursions on directed random graphs, A survey of max-type recursive distributional equations, The analysis of range quickselect and related problems, The functional equation of the smoothing transform, Process convergence for the complexity of radix selection on Markov sources, Analysis of the expected number of bit comparisons required by quickselect, Convergence of the population dynamics algorithm in the Wasserstein metric, 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