Pages that link to "Item:Q4383741"
From MaRDI portal
The following pages link to Comparisons in Hoare's Find Algorithm (Q4383741):
Displaying 15 items.
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- On a reciprocity law for finite multiple zeta values (Q606422) (← links)
- The analysis of range quickselect and related problems (Q650886) (← links)
- On quickselect, partial sorting and multiple Quickselect (Q845716) (← links)
- Distributional analysis of swaps in quick select (Q964394) (← links)
- Limit laws for the Randić index of random binary tree models (Q1019451) (← links)
- Binary search tree recursions with harmonic toll functions (Q1612306) (← links)
- Mixed Poisson approximation of node depth distributions in random binary search trees (Q1774220) (← links)
- The \(m\)-version of binary search trees: an average case analysis (Q1952717) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- Analysis of Hoare's FIND algorithm with Median-of-three partition (Q3122910) (← links)
- On the median-of-k version of Hoare's selection algorithm (Q4265537) (← links)
- Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization (Q4462705) (← links)
- On Smoothed Analysis of Quicksort and Hoare’s Find (Q5323060) (← links)
- Perpetuities in Fair Leader Election Algorithms (Q5415100) (← links)