Recursive Algorithms Analysis is the systematic study of algorithms that solve problems by recursively breaking them down into smaller instances, distinguished by its focus on characterizing time and space complexity through recurrence relations and mathematical induction.
65
Publications
2.4K
Citations
128
Authors
75
Institutions
Publications per year
2017–2026
3
Variants
Analysis Of Recursive Algorithms
Parents
Publications
65
1–5 of 65
Authors
128
- PFPhilippe Flajolet
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 28 citations
2
h-index
- HK
2
h-index
- DB
2
h-index
- JE
2
h-index
- GW
2
h-index
1–5 of 128
Institutions
75
National and Kapodistrian University of Athens
Athens, Greece
2 h-index
4 publications
156 citations
Brown University
Providence, United States
2 h-index
2 publications
35 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
35 citations
University of Bergen
Bergen, Norway
2 h-index
2 publications
355 citations
SUNY Geneseo
Geneseo, United States
2 h-index
6 publications
102 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
28 citations
McMaster University
Hamilton, Canada
2 h-index
3 publications
138 citations
University of Southern California
Los Angeles, United States
2 h-index
3 publications
58 citations
1–8 of 75
Venues
- IEEE Transactions on Information Theory
2 publications · 62 citations
2
h-index
- IEEE Transactions on Communications
1 publications · 13 citations
1
h-index
- The Annals of Probability
1 publications · 20 citations
1
h-index
- Journal of Mathematical Physics
1 publications · 49 citations
1
h-index
- Transportation Science
1 publications · 35 citations
1
h-index
1–5