Selecting the Median
From MaRDI portal
Publication:4268815
DOI10.1137/S0097539795288611zbMath0933.68062MaRDI QIDQ4268815
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07)
Related Items (17)
Select with Groups of 3 or 4 ⋮ Near-optimal online multiselection in internal and external memory ⋮ Optimal execution in Hong Kong given a market-on-close benchmark ⋮ On the upper bound of the complexity of sorting ⋮ Nearest neighbor representations of Boolean functions ⋮ Architecture independent parallel selection with applications to parallel priority queues ⋮ Unnamed Item ⋮ Range Medians ⋮ Better size estimation for sparse matrix products ⋮ On partial sorting in restricted rounds ⋮ Pairs of majority-decomposing functions ⋮ Finding a mediocre player ⋮ A selectable sloppy heap ⋮ Computing the update of the repeated median regression line in linear time ⋮ Selection Algorithms with Small Groups ⋮ On Floyd and Rivest's SELECT algorithm ⋮ On constant factors in comparison-based geometric algorithms and data structures
This page was built for publication: Selecting the Median
