An improved master theorem for divide-and-conquer recurrences

Abstract

We present a new master theorem for the study of divide-and-conquer recursive definitions, which improves the old one in several aspects. In particular, it provides more information, frees us completely from technicalities like floors and ceilings, and covers a wider set of toll functions and weight distributions, stochastic recurrences included.