Pages that link to "Item:Q4050138"

The following pages link to Expected time bounds for selection (Q4050138):

Displaying 40 items.

• Further analysis of the remedian algorithm (Q391134) (← links)
• Communication and energy efficient routing protocols for single-hop radio networks (Q433469) (← 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)
• Randomized algorithm for the sum selection problem (Q884471) (← links)
• Weighted median algorithms for \(L_ 1\) approximation (Q917229) (← links)
• Randomized selection in \(n+C+o(n)\) comparisons (Q1028991) (← links)
• A Bayesian approach to relevance in game playing (Q1127355) (← links)
• Selection by distributive partitioning (Q1144936) (← links)
• Semantics of probabilistic programs (Q1159979) (← links)
• Expected cost bounds for the selection and ordering procedures based on binary-type questions (Q1168674) (← links)
• Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
• Sorting in linear time? (Q1273863) (← links)
• Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
• Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
• Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
• Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics (Q1574221) (← links)
• The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors (Q1596137) (← links)
• Linear sorting with O(log n) processors (Q1838307) (← links)
• Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
• A selectable sloppy heap (Q2312418) (← links)
• A time warping approach to multiple sequence alignment (Q2406175) (← links)
• Tardiness bounds under global EDF scheduling on a multiprocessor (Q2479886) (← links)
• On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
• Some notes on robust sure independence screening (Q2953272) (← links)
• Parallel distributive partitioned sorting methods (Q3318123) (← links)
• Select with Groups of 3 or 4 (Q3449816) (← links)
• On the median-of-k version of Hoare's selection algorithm (Q4265537) (← links)
• BlockQuicksort (Q4629535) (← links)
• SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS (Q4820152) (← links)
• Geometric algorithms for the minimum cost assignment problem (Q4845077) (← links)
• Selection Algorithms with Small Groups (Q4983545) (← links)
• In-place linear probing sort (Q5096812) (← links)
• Streaming Algorithms for Selection and Approximate Sorting (Q5458820) (← links)
• EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES (Q5696958) (← links)
• Algorithms (Q5905704) (← links)
• Finding a mediocre player (Q5925497) (← links)
• Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (Q5943320) (← links)
• (Q6087214) (← links)
• Leveraging parameterized Chernoff bounds for simplified algorithm analyses (Q6602327) (← links)