A Master Theorem for Discrete Divide and Conquer Recurrences - Drmota, Michael; Szpankowski, Wojciech (Journal of the ACM, 2013)
Keywords: Algebra; Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Coding, codes; Computer science; Computer science; control theory; systems; Dirichlet problem; Divide & conquer algorithms; Exact sciences and technology; Information, signal and communications theory; Mathematical analysis; Mathematical functions; Mathematics; Number theory; Sciences and techniques of general use; Sequences, series, summability; Signal and communications theory; Studies; Telecommunications and information theory; Theorems; Theoretical computing; Recurrence; Mellin-Perron formula; Perron formula; Redundancy; Data compression; Matrix product; Modeling; Karatsuba algorithm; Master theorem; Sorting; Tauberian theorem; Central limit theorem; Algorithms; Divide-and-conquer recurrence; Arithmetic code; Dirichlet series; Asymptotic approximation; Boncelet's data compression algorithm; Fast algorithm; Strassen algorithm; Variable length code; Divide and conquer method; mergesort; Mellin transformation