The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Discrete Mathematics in Computer Science
Discrete Mathematics in Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Divide-and-conquer in multidimensional space
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Elements of discrete mathematics (McGraw-Hill computer science series)
Elements of discrete mathematics (McGraw-Hill computer science series)
On the Solution of Linear Recurrence Equations
Computational Optimization and Applications
Buffer Assignment Algorithms on Data Driven ASICs
IEEE Transactions on Computers
Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
A real elementary approach to the master recurrence and generalizations
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
| Hi-index | 0.00 |
The approximate complexity of divide-and-conquer algorithms is often described by recurrence relations of the formT(n) = kT(n/c) + f(n).The only well-defined method currently used for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note we describe a unifying method for solving these recurrences that is both general in applicability and easy to apply. This method is appropriate both as a classroom technique and as a tool for practicing algorithm designers.