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

DOI10.1006/JAGM.1994.1004zbMATH Open0820.68055OpenAlexW2092577037MaRDI QIDQ4289841FDOQ4289841

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

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

zbMATH Keywords

recurrencesmaster theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (13)

• Exact asymptotics of divide-and-conquer recurrences
• Improved master theorems for divide-and-conquer recurrences
• A master theorem for discrete divide and conquer recurrences
• A master theorem for discrete divide and conquer recurrences
• Proving divide and conquer complexities in Isabelle/HOL
• A real elementary approach to the master recurrence and generalizations
• Title not available (Why is that?)
• A recurrence relation for generalized divided differences with respect to ECT-systems
• Title not available (Why is that?)
• An exact solution for a master theorem type recurrence
• 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: 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)