Pages that link to "Item:Q2576874"
From MaRDI portal
The following pages link to On Floyd and Rivest's SELECT algorithm (Q2576874):
Displaying 14 items.
- Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
- Homogeneous string segmentation using trees and weighted independent sets (Q972999) (← links)
- Randomized selection in \(n+C+o(n)\) comparisons (Q1028991) (← links)
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
- On linear-time algorithms for the continuous quadratic Knapsack problem (Q2471117) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- BlockQuicksort (Q4629535) (← links)
- Progress in selection (Q5054828) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- Leveraging parameterized Chernoff bounds for simplified algorithm analyses (Q6602327) (← links)
