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

Authors

1.4K

  1. ZW
    Zidong Wang

    Brunel University of London, United Kingdom

    9 publications · 1.1K citations

    9

    h-index

  2. WC
    Weng Cho Chew

    University of Illinois Urbana-Champaign, United States

    7 publications · 394 citations

    7

    h-index

  3. SS
    Samer S. Saab

    Lebanese American University, Lebanon

    7 publications · 252 citations

    6

    h-index

  4. CN
    Christoforos N. Hadjicostis

    University of Cyprus, Cyprus

    5 publications · 138 citations

    5

    h-index

  5. MC
    M. C. Er

    University of Wollongong, Australia

    4 publications · 68 citations

    4

    h-index

1–5 of 1.4K

Venues

  1. IEEE Transactions on Signal Processing

    22 publications · 1.7K citations

    18

    h-index

  2. IEEE Transactions on Automatic Control

    19 publications · 2K citations

    16

    h-index

  3. IEEE Transactions on Reliability

    10 publications · 687 citations

    10

    h-index

  4. The Computer Journal

    9 publications · 888 citations

    9

    h-index

  5. IEEE Signal Processing Letters

    8 publications · 261 citations

    8

    h-index

1–5