An improved master theorem for divide-and-conquer recurrences
From MaRDI portal
Recommendations
- Improved master theorems for divide-and-conquer recurrences
- A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications
- scientific article; zbMATH DE number 7647200
- A real elementary approach to the master recurrence and generalizations
- A master theorem for discrete divide and conquer recurrences
Cites work
- A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications
- Analytic variations on quadtrees
- General Techniques for Analyzing Recursive Algorithms with Applications
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- Increasing the efficiency of quicksort
- Quicksort
Cited in
(14)- Singularity analysis, Hadamard products, and tree recurrences
- QuickXsort: a fast sorting scheme in theory and practice
- Proving divide and conquer complexities in Isabelle/HOL
- A real elementary approach to the master recurrence and generalizations
- Improved master theorems for divide-and-conquer recurrences
- A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications
- General Techniques for Analyzing Recursive Algorithms with Applications
- scientific article; zbMATH DE number 1545683 (Why is no real title available?)
- Exact asymptotics of divide-and-conquer recurrences
- scientific article; zbMATH DE number 833703 (Why is no real title available?)
- An exact solution for a master theorem type recurrence
- A master theorem for discrete divide and conquer recurrences
- A master theorem for discrete divide and conquer recurrences
- scientific article; zbMATH DE number 7647200 (Why is no real title available?)
This page was built for publication: An improved master theorem for divide-and-conquer recurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571976)