Pages that link to "Item:Q3578209"
From MaRDI portal
The following pages link to Improved master theorems for divide-and-conquer recurrences (Q3578209):
Displaying 15 items.
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- Multikey quickselect (Q472494) (← links)
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform (Q818111) (← links)
- Efficient sample sort and the average case analysis of PEsort (Q861251) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173) (← links)
- A new asymptotic notation: Weak Theta (Q1666904) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- Correlation between Shapley values of rooted phylogenetic trees under the beta-splitting model (Q2299260) (← links)
- Packing tripods: narrowing the density gap (Q2370436) (← links)
- A Real Elementary Approach to the Master Recurrence and Generalizations (Q3010381) (← links)
- Limit Theorems for Depths and Distances in Weighted Random <i>B</i>-Ary Recursive Trees (Q3108476) (← links)
- (Q4993558) (← links)
- On the expected cost of partial match queries in random quad-\(K\)-d trees (Q6130360) (← links)
- Identities and periodic oscillations of divide-and-conquer recurrences splitting at half (Q6153612) (← links)
