Finding the \(\alpha n\)-th largest element
From MaRDI portal
Publication:1912751
DOI10.1007/BF01300126zbMath0847.68048MaRDI QIDQ1912751
Publication date: 7 October 1996
Published in: Combinatorica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68W10: Parallel algorithms in computer science
Related Items
Comparator networks for binary heap construction, A selectable sloppy heap, Select with Groups of 3 or 4
Cites Work