Dynamic Programming Data Structures

Dynamic Programming Data Structures is a computational framework that systematically organizes and manages data to optimize recursive problem-solving by storing and reusing intermediate results through memoization or tabulation.

32

Publications

921

Citations

61

Authors

36

Institutions

Publications per year

2017–2026

4

Authors

61

  1. AR
    Anne Rogers

    Princeton University, United States

    3 publications · 189 citations

    3

    h-index

  2. MC
    Martin C. Carlisle

    United States Air Force Academy, United States

    3 publications · 189 citations

    3

    h-index

  3. SP
    Steffen Peter

    Leibniz Institute for High Performance Microelectronics, Germany

    2 publications · 114 citations

    2

    h-index

  4. HT
    Hisao Tamaki

    Meiji University, Japan

    2 publications · 69 citations

    2

    h-index

  5. GS
    Gary Sevitsky

    IBM (United States), United States

    2 publications · 133 citations

    2

    h-index

1–5 of 61

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 28 citations

    2

    h-index

  2. ACM SIGPLAN Notices

    2 publications · 41 citations

    2

    h-index

  3. European Journal of Operational Research

    2 publications · 28 citations

    2

    h-index

  4. Asian Journal of Applied Science and Engineering

    AJASE · 1 publications · 14 citations

    1

    h-index

  5. International Conference on Machine Learning

    Conference · 1 publications · 50 citations

    1

    h-index

1–5