A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications

DOI10.1006/JAGM.1994.1004MaRDI QIDQ4289841zbMATH OpenOpenAlexFDO

Authors Rakesh M. Verma

Publication date 27 August 1995

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1994.1004

zbMATH Keywords

recurrencesmaster theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An improved master theorem for divide-and-conquer recurrences
• Improved master theorems for divide-and-conquer recurrences
• A real elementary approach to the master recurrence and generalizations
• scientific article; zbMATH DE number 7647200
• General Techniques for Analyzing Recursive Algorithms with Applications

Cited in

(13)

• Proving divide and conquer complexities in Isabelle/HOL
• An improved master theorem for divide-and-conquer recurrences
• Exact asymptotics of divide-and-conquer recurrences
• Improved master theorems for divide-and-conquer recurrences
• An exact solution for a master theorem type recurrence
• A recurrence relation for generalized divided differences with respect to ECT-systems
• A frame for general divide-and-conquer recurrences
• Mathematical methods for the analysis of recursive algorithms
• A real elementary approach to the master recurrence and generalizations
• scientific article; zbMATH DE number 833703 (Why is no real title available?)
• 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: A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289841)