The following pages link to Selecting the Median (Q4268815):
Displaying 17 items.
- Computing the update of the repeated median regression line in linear time (Q1028994) (← links)
- Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
- Pairs of majority-decomposing functions (Q1799568) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- Better size estimation for sparse matrix products (Q2249750) (← links)
- A selectable sloppy heap (Q2312418) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- Near-optimal online multiselection in internal and external memory (Q2634712) (← links)
- On the upper bound of the complexity of sorting (Q2662813) (← links)
- Nearest neighbor representations of Boolean functions (Q2672259) (← links)
- Select with Groups of 3 or 4 (Q3449816) (← links)
- Range Medians (Q3541112) (← links)
- Optimal execution in Hong Kong given a market-on-close benchmark (Q4554447) (← links)
- Selection Algorithms with Small Groups (Q4983545) (← links)
- Finding a mediocre player (Q5925497) (← links)
- (Q6087214) (← links)
