Improved master theorems for divide-and-conquer recurrences
From MaRDI portal
Publication:3578209
DOI10.1145/375827.375837zbMath1190.68097OpenAlexW1966637680MaRDI QIDQ3578209
Publication date: 14 July 2010
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/375827.375837
Related Items (16)
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform ⋮ Packing tripods: narrowing the density gap ⋮ Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ Efficient sample sort and the average case analysis of PEsort ⋮ A new asymptotic notation: Weak Theta ⋮ Unnamed Item ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ On the expected cost of partial match queries in random quad-\(K\)-d trees ⋮ Identities and periodic oscillations of divide-and-conquer recurrences splitting at half ⋮ Median and hybrid median \(K\)-dimensional trees ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ Multikey quickselect ⋮ A Real Elementary Approach to the Master Recurrence and Generalizations ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ Correlation between Shapley values of rooted phylogenetic trees under the beta-splitting model ⋮ Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees
This page was built for publication: Improved master theorems for divide-and-conquer recurrences
