Pages that link to "Item:Q760796"
From MaRDI portal
The following pages link to Exponential bounds for the running time of a selection algorithm (Q760796):
Displaying 9 items.
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- A fixed point theorem for distributions (Q1194594) (← links)
- Linear sorting with O(log n) processors (Q1838307) (← links)
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSelect (Q2837754) (← links)
- QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find (Q3191202) (← links)
- On the median-of-k version of Hoare's selection algorithm (Q4265537) (← links)
- Analysis of quickselect : an algorithm for order statistics (Q4858843) (← links)
- A limit theorem for “quicksort” (Q5750394) (← links)