论文信息 - An Improved Master Theorem for Divide-and-Conquer Recurrences

An Improved Master Theorem for Divide-and-Conquer Recurrences

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.

Salvador Roura

[1] Gerard J. Chang,et al. The Profile Minimization Problem in Trees , 1994, SIAM J. Comput..

[2] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .

[3] Philippe Flajolet,et al. An introduction to the analysis of algorithms , 1995 .

[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[5] Richard M. Karp,et al. Probabilistic recurrence relations , 1994, JACM.

[6] M. H. van Emden. Increasing the efficiency of quicksort , 1970, CACM.

[7] C. A. R. Hoare. Algorithm 63: partition , 1961, CACM.

[8] Ming-Yang Kao. Multiple-size divide-and-conquer recurrences , 1997, SIGA.

[9] Rakesh M. Verma. General Techniques for Analyzing Recursive Algorithms with Applications , 1997, SIAM J. Comput..

[10] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.

[11] Rakesh M. Verma. A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications , 1994, J. Algorithms.

[12] Xiadong Wang,et al. A Frame for General Divide-and-Conquer Recurrences , 1996, Inf. Process. Lett..