Randomized selection in \(n+C+o(n)\) comparisons

DOI10.1016/S0020-0190(03)00361-2zbMath1178.68664OpenAlexW2122679460MaRDI QIDQ1028991

Constantinos J. Siniolakis, Alexandros V. Gerbessiotis

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00361-2

zbMATH Keywords

selectionrandomized algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items

On Floyd and Rivest's SELECT algorithm

Cites Work

• Unnamed Item
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Finding the median
• Time bounds for selection
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Expected time bounds for selection
• Merging on the BSP model