Improved master theorems for divide-and-conquer recurrences

Journal of the ACM

Volumn 48, Issue 2, 2001, Pages 170-205

  Roura, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Asymptotic analysis; Divide and conquer; Master theorem

Indexed keywords

ALGORITHMS; FUNCTIONS; MATHEMATICAL TECHNIQUES; PROBLEM SOLVING;

ASYMPTOTIC ANALYSIS; DIVIDE-AND-CONQUER; LEMMAS; MASTER THEOREMS;

THEOREM PROVING;

EID: 0009749612     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/375827.375837     Document Type: Article

References (18)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. BENTLEY, J. L., HAKEN, D., AND SAXE, J. B. 1980. A general method for solving divide-and-conquer recurrences. SIGACT News 12, 3, 36-44.
3. CORMEN, T. H., LEISERSON, C. E., AND RIVE ST, R. L. 1990. Introduction to Algorithms. The MIT Press, Cambridge, Mass.
4. FLAJOLET, P., AND GOLIN, M. 1994. Mellin transforms and asymptotics. Acta Inf. 31, 673-696.
5. FLAJOLET, P., GONNET, G., PUECH, C., AND ROBSON, J. M. 1993. Analytic variations on quadtrees. Algorithmica 10, 473-500.
6. HAGERUP, T., AND RUB, C. 1990. A guided tour of chernoff bounds. Inf. Proc. Lett. 33, 305-308.
7. HOARE, C. A. R. 1961. FIND (Algorithm 65). Commun. ACM 4, 321-322.
8. HOARE, C. A. R. 1962. Quicksort. Computer J. 5, 10-15.
9. KAO, M. 1997. Multiple-size divide-and-conquer recurrences. SIGACT News 28, 2 (June), 67-69.
10. KARP, R. M. 1994. Probabilistic recurrence relations. J. ACM 41, 6 (Nov.), 1136-1150.
11. KUO, D., AND CHANG, G. J. 1994. The profile minimization problem in trees. SIAM J. Comput. 23, 1 (Feb.), 71-81.
12. MARTÍNEZ, C., AND ROURA, S. 1998. Optimal sample sizes for quicksort and quickselect. Tech. R̀ep. LSI-98-1-R. Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Catalonia, Spain.
13. ROURA, S. 1997a. Divide-and-conquer algorithms and data structures. Ph.D. dissertation. Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Catalonia, Spain.
14. ROURA, S. 1997b. An improved master theorem for divide-and-conquer recurrences. In Proceedings of the 24th International Colloquium (ICALP '97). Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, Eds. Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, New York, pp. 449-459.
15. SEDGEWICK, R., AND FLAJOLET, P. 1996. An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, Mass.
16. VERMA, R. M. 1994. A general method and a master theorem for divide-and-conquer recurrences with applications. J. Algorithms 16, 67-79.
17. VERMA, R. M. 1997. General techniques for analyzing recursive algorithms with applications. SIAM J. Comput. 26, 568-581.
18. WANG, X., AND FU, Q. 1996. A frame for divide-and-conquer recurrences. Inf. Proc. Lett. 59, 45-51.