Recursive Algorithm Design
Recursive Algorithm Design is a methodological framework within algorithmic problem-solving that systematically decomposes a computational problem into smaller instances of the same problem, solves them recursively, and combines their solutions to construct a solution to the original problem, distinguishing itself from iterative or non-recursive methods by its reliance on self-referential function calls and base-case termination.
644
Publications
46.3K
Citations
1.4K
Authors
657
Institutions
Publications per year
2017–2026
91
Parents
644
Incremental and Decremental Support Vector Machine Learning
Gert Cauwenberghs, Tomaso Poggio · 2000 · 1.2K citations
1–5 of 644
1.4K
9
h-index
7
h-index
6
h-index
5
h-index
4
h-index
1–5 of 1.4K
657
University of Illinois Urbana-Champaign
Urbana, United States
14 h-index
37 publications
1.7K citations
Tsinghua University
Beijing, China
10 h-index
24 publications
1K citations

Brunel University of London
London, United Kingdom
9 h-index
9 publications
1.1K citations
University of California, Berkeley
Berkeley, United States
9 h-index
11 publications
518 citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
12 publications
516 citations
Nanyang Technological University
Singapore, Singapore
7 h-index
11 publications
357 citations

Southeast University
Nanjing, China
6 h-index
10 publications
246 citations
The University of Texas at Austin
Austin, United States
6 h-index
11 publications
309 citations
1–8 of 657
22 publications · 1.7K citations
18
h-index
19 publications · 2K citations
16
h-index
10 publications · 687 citations
10
h-index
9 publications · 888 citations
9
h-index
8 publications · 261 citations
8
h-index
1–5