Pages that link to "Item:Q3122910"
From MaRDI portal
The following pages link to Analysis of Hoare's FIND algorithm with Median-of-three partition (Q3122910):
Displaying 15 items.
- The middle pivot element algorithm (Q355523) (← links)
- The analysis of range quickselect and related problems (Q650886) (← links)
- Multiple Quickselect -- Hoare's Find algorithm for several elements (Q672250) (← links)
- Limit laws for the Randić index of random binary tree models (Q1019451) (← links)
- Analysis of multiple quickselect variants. (Q1401319) (← links)
- Almost sure convergence to the quicksort process (Q2196368) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- On the median-of-k version of Hoare's selection algorithm (Q4265537) (← links)
- Comparisons in Hoare's Find Algorithm (Q4383741) (← links)
- Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization (Q4462705) (← links)
- BlockQuicksort (Q4629535) (← links)
- A generating functions approach for the analysis of grand averages for multiple QUICKSELECT (Q4705339) (← links)
- Using nonlinear difference equations to study Quicksort algorithms (Q4960142) (← links)
- On Smoothed Analysis of Quicksort and Hoare’s Find (Q5323060) (← links)