The following pages link to Time bounds for selection (Q1394121):
Displaying 50 items.
- Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← links)
- Dynamic range majority data structures (Q306716) (← links)
- The connected \(p\)-median problem on block graphs (Q315481) (← links)
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- Faster output-sensitive skyline computation algorithm (Q402378) (← links)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Computing of high breakdown regression estimators without sorting on graphics processing units (Q425179) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Coverage restricted to an angle (Q433118) (← links)
- Multiprocessor extensions to real-time calculus (Q438179) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- A generalized boxplot for skewed and heavy-tailed distributions (Q464477) (← links)
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← links)
- On two-machine flow shop scheduling (Q489134) (← links)
- Finding the minimum number of elements with sum above a threshold (Q497136) (← links)
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- Finding a non-minority ball with majority answers (Q505416) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- The median and its extensions (Q549333) (← links)
- Refined complexity analysis for heap operations (Q578912) (← links)
- On an optimization problem with nested constraints (Q583110) (← links)
- Algebraic optimization: The Fermat-Weber location problem (Q584057) (← links)
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
- On computing an optimal permutation of ranks for multiselection (Q623154) (← links)
- An optimal boundary fair scheduling algorithm for multiprocessor real-time systems (Q645817) (← links)
- Optimal parallel selection in sorted matrices (Q671400) (← links)
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Speeding up dynamic programming in the line-constrained \(k\)-median (Q726094) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- Exponential bounds for the running time of a selection algorithm (Q760796) (← links)
- Selection in \(X+Y\) and matrices with sorted rows and columns (Q761793) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Online production planning to maximize the number of on-time orders (Q829183) (← links)
- Two new methods for constructing double-ended priority queues from priority queues (Q836938) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Randomized algorithm for the sum selection problem (Q884471) (← links)
- Average-case complexity of the min-sum matrix product problem (Q897863) (← links)
- Parallel selection (Q913517) (← links)
- Weighted median algorithms for \(L_ 1\) approximation (Q917229) (← links)
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953) (← links)
- Matching points with rectangles and squares (Q955221) (← links)
- Fast algorithm for multicast and data gathering in wireless networks (Q963390) (← links)
- Relaxed voting and competitive location under monotonous gain functions on trees (Q968153) (← links)
- Applying fuzzy weighted average approach to evaluate office layouts with Feng-shui consideration (Q970061) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- On sorting, heaps, and minimum spanning trees (Q973020) (← links)
- Cache-oblivious selection in sorted \(X+Y\) matrices (Q975535) (← links)
