Finding the \(\alpha n\)-th largest element

DOI10.1007/BF01300126zbMath0847.68048MaRDI QIDQ1912751

Uri Zwick, Dorit Dor

Publication date: 7 October 1996

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

selection problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (8)

Select with Groups of 3 or 4 ⋮ Progress in selection ⋮ Unnamed Item ⋮ Comparator networks for binary heap construction ⋮ Finding a mediocre player ⋮ A selectable sloppy heap ⋮ Selection Algorithms with Small Groups ⋮ Comparator networks for binary heap construction

Cites Work

• Unnamed Item
• Unnamed Item
• A note on upper bounds for the selection problem
• Finding the median
• Time bounds for selection
• New algorithms for selection
• A New Lower Bound for the Set-Partitioning Problem
• Average case selection
• Expected time bounds for selection
• New upper bounds for selection

This page was built for publication: Finding the \(\alpha n\)-th largest element