General Techniques for Analyzing Recursive Algorithms with Applications
From MaRDI portal
Publication:4337634
Recommendations
- A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications
- A frame for general divide-and-conquer recurrences
- Improved master theorems for divide-and-conquer recurrences
- An improved master theorem for divide-and-conquer recurrences
- On the solution of linear recurrence equations
Cited in
(8)- Improved master theorems for divide-and-conquer recurrences
- Packing tripods: narrowing the density gap
- Proving divide and conquer complexities in Isabelle/HOL
- An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences
- Analytic solution of a special class of recurrence relations for the analysis of recursive algorithms
- Mathematical methods for the analysis of recursive algorithms
- An improved master theorem for divide-and-conquer recurrences
- A frame for general divide-and-conquer recurrences
This page was built for publication: General Techniques for Analyzing Recursive Algorithms with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337634)