Finding the n-th largest element

DOI10.1007/BF01300126zbMATH Open0847.68048MaRDI QIDQ1912751FDOQ1912751

Uri Zwick, Dorit Dor

Publication date: 7 October 1996

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• New algorithms for selection
• Exponential bounds for the running time of a selection algorithm
• On Floyd and Rivest's SELECT algorithm
• On selecting the k largest with median tests
• Finding an Approximate Maximum

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)

Cites Work

• Time bounds for selection
• Title not available (Why is that?)
• Average case selection
• Expected time bounds for selection
• Finding the median
• Title not available (Why is that?)
• A note on upper bounds for the selection problem
• New upper bounds for selection
• New algorithms for selection
• A New Lower Bound for the Set-Partitioning Problem

Cited In (10)

• Exponential bounds for the running time of a selection algorithm
• Progress in selection
• Select with Groups of 3 or 4
• Selection Algorithms with Small Groups
• Comparator networks for binary heap construction
• Title not available (Why is that?)
• Finding a mediocre player
• New algorithms for selection
• A selectable sloppy heap
• Comparator networks for binary heap construction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1912751)