A general method for solving divide-and-conquer recurrences-Reference-Cited by-同舟云学术

A general method for solving divide-and-conquer recurrences

Published:1980-09 Issue:3 Volume:12 Page:36-44
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Bentley Jon Louis¹,Haken Dorothea¹,Saxe James B.¹

Affiliation:

1. Carnegie-Mellon University, Pittsburgh, Pennsylvania

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/1008861.1008865

Reference13 articles.

1. Aho A. V. J. E. Hopcroft and J. D. Ullman {1974}. The Design and Analysis of Computer Algorithms Addison-Wesley Reading Mass. Aho A. V. J. E. Hopcroft and J. D. Ullman {1974}. The Design and Analysis of Computer Algorithms Addison-Wesley Reading Mass.

2. Divide-and-conquer in multidimensional space

3. Borodin A. and I. Munro {1975}. The Computational Complexity of Algebraic and Numeric Problems American Elsevier New York N.Y. Borodin A. and I. Munro {1975}. The Computational Complexity of Algebraic and Numeric Problems American Elsevier New York N.Y.

4. A Tournament Problem

5. Keller K. {1980}. "Computation cost functions for divide-and-conquer algorithms" to appear in Journal of Undergraduate Mathematics. Keller K. {1980}. "Computation cost functions for divide-and-conquer algorithms" to appear in Journal of Undergraduate Mathematics.

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Identities and periodic oscillations of divide-and-conquer recurrences splitting at half;Advances in Applied Mathematics;2024-04

2. Tunnel: Parallel-inducing sort for large string analytics;Future Generation Computer Systems;2023-12

3. Reducing Reconfiguration Time in Hybrid Optical-Electrical Datacenter Networks;Proceedings of the 7th Asia-Pacific Workshop on Networking;2023-06-29

4. Space–Time Continuum Metric;Algorithms for Intelligent Systems;2023

5. Worldwide Mobility Trends and the COVID-19 Pandemic: A Federated Regression Analysis During the pandemic’s Early Stage;Big Data Analytics for Smart Urban Systems;2023