Recursion Tree Analysis is a methodological framework in algorithm analysis that systematically visualizes and sums the costs of recursive subproblems across levels of a tree structure to determine the time complexity of divide-and-conquer algorithms.
17
Publications
1.1K
Citations
35
Authors
22
Institutions
Publications per year
2017–2026
1
Variants
Recursion Tree Method
Parents
Publications
17
Static determination of dynamic properties of recursive procedures
Patrick Cousot, Radhia Cousot · 1977 · 178 citations
A. Meir, J. W. Moon · Mathematical Biosciences · 1974 · 80 citations
Probabilistic analysis of bucket recursive trees
Hosam M. Mahmoud, R. T. Smythe · Theoretical Computer Science · 1995 · 38 citations
1–5 of 17
Authors
35
- MK
2
h-index
- AP
2
h-index
- SC
1
h-index
- LP
1
h-index
- PC
1
h-index
1–5 of 35
Institutions
22
TU Wien
Vienna, Austria
2 h-index
4 publications
44 citations
Edinburgh Napier University
Edinburgh, United Kingdom
1 h-index
1 publications
487 citations
Tulane University
New Orleans, United States
1 h-index
1 publications
11 citations
George Washington University
Washington, United States
1 h-index
2 publications
76 citations
AT&T (United States)
Bedminster, United States
1 h-index
1 publications
11 citations
New York University
New York, United States
1 h-index
1 publications
19 citations
Hangzhou Dianzi University
Hangzhou, China
1 h-index
4 publications
112 citations
Institute of Mathematical Sciences
Chennai, India
1 h-index
1 publications
19 citations
1–8 of 22
Venues
- Theoretical Computer Science
3 publications · 137 citations
3
h-index
- Frontiers of Information Technology & Electronic Engineering
1 publications · 28 citations
1
h-index
- Acta Informatica
1 publications · 23 citations
1
h-index
- Mathematical Biosciences
1 publications · 80 citations
1
h-index
- Journal of Systems and Software
JSS · 1 publications · 17 citations
1
h-index
1–5