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

Authors

1.8K

  1. WV
    Walter Van Assche

    KU Leuven, Belgium

    16 publications · 885 citations

    15

    h-index

  2. ME
    Mourad E. H. Ismail

    University of South Florida, United States

    12 publications · 753 citations

    12

    h-index

  3. AR
    A. Ronveaux

    University of Namur, Belgium

    12 publications · 534 citations

    12

    h-index

  4. FQ
    Feng Qi

    Henan Polytechnic University, China

    13 publications · 283 citations

    12

    h-index

  5. FL
    Florian Luca

    Universidad Nacional Autónoma de México, Mexico

    11 publications · 247 citations

    10

    h-index

1–5 of 1.8K

Venues

  1. ˜The œFibonacci quarterly

    39 publications · 1K citations

    20

    h-index

  2. Journal of Approximation Theory

    33 publications · 1.4K citations

    20

    h-index

  3. Journal of Computational and Applied Mathematics

    27 publications · 938 citations

    19

    h-index

  4. Transactions of the American Mathematical Society

    TRAN · 22 publications · 875 citations

    18

    h-index

  5. IEEE Transactions on Information Theory

    23 publications · 963 citations

    17

    h-index

1–5