论文信息 - Improved master theorems for divide-and-conquer recurrences

Improved master theorems for divide-and-conquer recurrences

This paper presents new theorems to analyze divide-and-conquer recurrences, which improve other similar ones in several aspects. In particular, these theorems provide more information, free us almost completely from technicalities like floors and ceilings, and cover a wider set of toll functions and weight distributions, stochastic recurrences included.

Salvador Roura | Salvador Roura

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

[2] J. Saxe,et al. A general method for solving divide-and-conquer recurrences , 1980, SIGA.

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

[4] Torben Hagerup,et al. A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

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

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

[7] Salvador Roura. An Improved Master Theorem for Divide-and-Conquer Recurrences , 1997, ICALP.

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

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

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

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

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