A frame for general divide-and-conquer recurrences

Information Processing Letters

Volumn 59, Issue 1, 1996, Pages 45-51

  Wang, Xiaodong ^a   Fu, Qingxiang ^a  

^a FUZHOU UNIVERSITY   (China)

Author keywords

Algorithms; Divide and conquer; Recurrence; Time complexity

Indexed keywords

EID: 4243195202     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00076-2     Document Type: Article

References (6)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data Structures and Algorithms (Addison-Wesley, Reading, MA, 1983).
2. J.L. Bentley, D. Haken and J.B. Saxe, A general method for solving divide-and-conquer recurrence, SIGACT News 12 (1980) 36-44.
3. A.K. Chandra, L. Stockmeyer and U. Vishkin, Constant depth reducibility, SIAM J. Comput. 13 (1984) 423-439.
4. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press/McGraw-Hill, New York, 1990).
5. J.H. Reif and S. Sen, An efficient output-sensitive hidden-surface removal algorithm and its parallelization, in: Proc. ACM Symp. on Computational Geometry, 1988.
6. R.M. Verma, A general method and a master theorem for divide-and-conquer recurrences with applications, J. Algorithms 16 (1994) 67-79.