Finding the median
From MaRDI portal
Cites work
Cited in
(47)- Randomized selection in \(n+C+o(n)\) comparisons
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- An improved algorithm for finding the median distributively
- Distributed algorithms for selection in sets
- Determining the mode
- Selection by distributive partitioning
- Producing posets
- Efficient searching using partial ordering
- Bin packing can be solved within 1+epsilon in linear time
- A note on upper bounds for the selection problem
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- The Min-Max Spanning Tree Problem and some extensions
- Sorting by distributive partitioning
- The double selection problem
- Architecture independent parallel selection with applications to parallel priority queues
- Comparator networks for binary heap construction
- Linear sorting with O(log n) processors
- Finding the n-th largest element
- On partial sorting in restricted rounds
- A selectable sloppy heap
- Selecting distances in the plane
- Faster suffix sorting
- On Floyd and Rivest's SELECT algorithm
- Near-optimal online multiselection in internal and external memory
- On the upper bound of the complexity of sorting
- Select with groups of 3 or 4
- Range Medians
- On the lower bound for minimum comparison selection
- scientific article; zbMATH DE number 3757716 (Why is no real title available?)
- Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
- Optimal sampling strategies for quicksort
- Selection Algorithms with Small Groups
- Progress in selection
- Comparator networks for binary heap construction
- Necklaces, convolutions, and \(X+Y\)
- Finding a mediocre player
- On the complexity of coupled-task scheduling
- scientific article; zbMATH DE number 7765400 (Why is no real title available?)
- Linear-time in-place selection in less than 3n comparisons
- Optimal parallel selection in sorted matrices
- Heaps with bits
- Selection from read-only memory and sorting with minimum data movement
- Deterministic cache-oblivious funnelselect
- Exponential bounds for the running time of a selection algorithm
- The recursive structure of some ordering problems
This page was built for publication: Finding the median
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229583)
