Recurrence Relations
Recurrence Relations is a mathematical equation used in the analysis of algorithms that characterizes a performance measure (such as running time or space) on inputs of size \(n\) as a function of the same measure on smaller input sizes together with any non-recursive cost terms.
1.4K
Publications
67.1K
Citations
1.8K
Authors
932
Institutions
Publications per year
2017–2026
111
Variants
Recurrence Equations
Parents
1.4K
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
Richard Bellman · Indiana University Mathematics Journal · 1957 · 2.4K citations
1–5 of 1.4K
1.8K
15
h-index
12
h-index
12
h-index
12
h-index
10
h-index
1–5 of 1.8K
932
KU Leuven
Leuven, Belgium
18 h-index
37 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
13 h-index
21 publications
570 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
13 h-index
24 publications
1.7K citations

Lomonosov Moscow State University
Moscow, Russia
12 h-index
15 publications
833 citations
Stanford University
Stanford, United States
12 h-index
18 publications
3.2K citations
Henan Polytechnic University
Jiaozuo, China
11 h-index
15 publications
338 citations

Universidad Carlos III de Madrid
Madrid, Spain
11 h-index
14 publications
352 citations
University of California, Berkeley
Berkeley, United States
11 h-index
16 publications
1.5K citations
1–8 of 932
39 publications · 1K citations
20
h-index
33 publications · 1.4K citations
20
h-index
27 publications · 938 citations
19
h-index
TRAN · 22 publications · 875 citations
18
h-index
23 publications · 963 citations
17
h-index
1–5