Pages that link to "Item:Q4265537"
From MaRDI portal
The following pages link to On the median-of-k version of Hoare's selection algorithm (Q4265537):
Displaying 13 items.
- Multiple Quickselect -- Hoare's Find algorithm for several elements (Q672250) (← links)
- Exponential bounds for the running time of a selection algorithm (Q760796) (← links)
- On ``An improved algorithm for finding the median distributively'' (Q1310466) (← links)
- On the analysis of stochastic divide and conquer algorithms (Q1840514) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- A Gaussian limit process for optimal FIND algorithms (Q2637747) (← links)
- On lower bounds for selecting the median (Q2719173) (← links)
- On the number of iterations required by von Neumann addition (Q2771496) (← links)
- Analysis of Hoare's FIND algorithm with Median-of-three partition (Q3122910) (← links)
- The Worst Case Permutation for Median-of-Three Quicksort (Q3332256) (← links)
- Comparisons in Hoare's Find Algorithm (Q4383741) (← links)
- A generating functions approach for the analysis of grand averages for multiple QUICKSELECT (Q4705339) (← links)