The following pages link to Time bounds for selection (Q1394121):
Displaying 50 items.
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- Randomized selection in \(n+C+o(n)\) comparisons (Q1028991) (← links)
- NP-hard and linear variants of hypergraph partitioning (Q1041217) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- A linear time bin-packing algorithm (Q1062626) (← links)
- An improved algorithm for finding the median distributively (Q1101218) (← links)
- Upper bounds for time-space trade-offs in sorting and selection (Q1101238) (← links)
- Efficient selection on a binary tree (Q1108019) (← links)
- Distributed algorithms for selection in sets (Q1112607) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
- A Bayesian approach to relevance in game playing (Q1127355) (← links)
- Determining the mode (Q1143172) (← links)
- Selection by distributive partitioning (Q1144936) (← links)
- Efficient searching using partial ordering (Q1151264) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- The complexity of selection and ranking in X+Y and matrices with sorted columns (Q1161291) (← 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)
- Hyperbolic 0-1 programming and query optimization in information retrieval (Q1181735) (← links)
- A linear algorithm for bisecting a polygon (Q1186591) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- Geometric medians (Q1201233) (← links)
- A heuristic for preemptive scheduling with set-up times (Q1202243) (← links)
- Simple bounds on the convergence rate of an ergodic Markov chain (Q1209327) (← links)
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees (Q1218265) (← links)
- Finding the median (Q1229583) (← links)
- Sorting by distributive partitioning (Q1244813) (← links)
- A linear selection algorithm for sets of elements with weights (Q1249045) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q1265327) (← links)
- Geometric applications of posets (Q1276942) (← links)
- Optimal layout of edge-weighted forests (Q1276965) (← links)
- Robust economic order quantity models (Q1278127) (← links)
- Restricted center problems under polyhedral gauges (Q1291660) (← links)
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
- Algorithms for parallel memory, I: Two-level memories (Q1333432) (← links)
- Sorting multisets stably in minimum space (Q1338888) (← links)
- Incomplete generalized \(L\)-statistics (Q1354475) (← links)
- Bicriteria and restricted 2-facility Weber problems (Q1362675) (← links)
- Batch RSA (Q1363068) (← links)
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- A more efficient algorithm for MPR problems in phylogeny (Q1382281) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- An approximation scheme for strip packing of rectangles with bounded dimensions (Q1383370) (← links)
- Illumination by floodlights (Q1388133) (← links)
- Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
- Polynomial time algorithms for three-label point labeling. (Q1401261) (← links)
