The following pages link to QUICKSELECT revisited (Q2834338):
Displaying 11 items.
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- On quickselect, partial sorting and multiple Quickselect (Q845716) (← links)
- Distributional analysis of swaps in quick select (Q964394) (← links)
- On the analysis of stochastic divide and conquer algorithms (Q1840514) (← links)
- The quicksort process (Q2434753) (← links)
- A simple expected running time analysis for randomized ``divide and conquer'' algorithms (Q2581554) (← links)
- A Gaussian limit process for optimal FIND algorithms (Q2637747) (← links)
- Fast Deterministic Selection (Q4580181) (← links)
- (Q4640773) (← links)
- Perpetuities in Fair Leader Election Algorithms (Q5415100) (← links)
- Knowledge Discovery in Inductive Databases (Q5899028) (← links)