The following pages link to Finding the median (Q1229583):
Displaying 46 items.
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Optimal parallel selection in sorted matrices (Q671400) (← links)
- Heaps with bits (Q671419) (← links)
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Exponential bounds for the running time of a selection algorithm (Q760796) (← links)
- The recursive structure of some ordering problems (Q802870) (← links)
- Randomized selection in \(n+C+o(n)\) comparisons (Q1028991) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
- An improved algorithm for finding the median distributively (Q1101218) (← links)
- Distributed algorithms for selection in sets (Q1112607) (← links)
- Determining the mode (Q1143172) (← links)
- Selection by distributive partitioning (Q1144936) (← links)
- Producing posets (Q1151047) (← links)
- Efficient searching using partial ordering (Q1151264) (← links)
- Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
- A note on upper bounds for the selection problem (Q1171384) (← links)
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems (Q1186949) (← links)
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees (Q1218265) (← links)
- The Min-Max Spanning Tree Problem and some extensions (Q1244239) (← links)
- Sorting by distributive partitioning (Q1244813) (← links)
- The double selection problem (Q1262124) (← links)
- Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
- Comparator networks for binary heap construction (Q1589657) (← links)
- Linear sorting with O(log n) processors (Q1838307) (← links)
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- A selectable sloppy heap (Q2312418) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- Faster suffix sorting (Q2465058) (← 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)
- Select with Groups of 3 or 4 (Q3449816) (← links)
- Range Medians (Q3541112) (← links)
- On the lower bound for minimum comparison selection (Q3851641) (← links)
- (Q3940856) (← links)
- Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers (Q4805931) (← links)
- Optimal sampling strategies for quicksort (Q4858238) (← links)
- Selection Algorithms with Small Groups (Q4983545) (← links)
- Progress in selection (Q5054828) (← links)
- Comparator networks for binary heap construction (Q5054852) (← links)
- Finding a mediocre player (Q5925497) (← links)
- On the complexity of coupled-task scheduling (Q5961610) (← links)
- (Q6087214) (← links)
- Linear-time in-place selection in less than 3n comparisons (Q6487970) (← links)
