The following pages link to (Q4886030):
Displaying 14 items.
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Comparing medians (Q1010541) (← links)
- An improved algorithm for finding the median distributively (Q1101218) (← links)
- On selecting the k largest with median tests (Q1115626) (← links)
- The double selection problem (Q1262124) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Comparator networks for binary heap construction (Q1589657) (← links)
- Partial sorting problem on evolving data (Q1679242) (← links)
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- Median bounds and their application (Q2709799) (← links)
- Median selection requires \((2+\varepsilon)n\) comparisons (Q2719174) (← links)
- Progress in selection (Q5054828) (← links)
- Comparator networks for binary heap construction (Q5054852) (← links)
- Finding a mediocre player (Q5925497) (← links)
