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
Parents
32
Software caching and computation migration in Olden
Martin C. Carlisle, Anne Rogers · 1995 · 146 citations
Finding low-utility data structures
Guoqing Xu, Nick Mitchell, Matthew Arnold et al. · 2010 · 118 citations
1–5 of 32
61
3
h-index
3
h-index
Leibniz Institute for High Performance Microelectronics, Germany
2 publications · 114 citations
2
h-index
2
h-index
2
h-index
1–5 of 61
36
Princeton University
Princeton, United States
3 h-index
6 publications
378 citations
IBM (United States)
Armonk, United States
2 h-index
8 publications
532 citations

Meiji University
Tokyo, Japan
2 h-index
2 publications
69 citations
Bielefeld University
Bielefeld, Germany
2 h-index
5 publications
328 citations
The Ohio State University
Columbus, United States
2 h-index
4 publications
266 citations
Charles University
Prague, Czechia
1 h-index
2 publications
34 citations

University of British Columbia
Vancouver, Canada
1 h-index
2 publications
100 citations
Duke University
Durham, United States
1 h-index
1 publications
16 citations
1–8 of 36
Repository · 2 publications · 28 citations
2
h-index
2 publications · 41 citations
2
h-index
2 publications · 28 citations
2
h-index
AJASE · 1 publications · 14 citations
1
h-index
Conference · 1 publications · 50 citations
1
h-index
1–5