On the public citation graph
A Comprehensive Model of Dynamic Programming
0 signed · 22 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1959.tb01583.xopenalex-snapshot
Variable-Length Binary Encodings
inferredcites →https://doi.org/10.1016/0166-9834(88)80018-6openalex-snapshot
Chemical engineering progress
inferredcites →https://doi.org/10.1016/s0019-9958(75)90151-5openalex-snapshot
Minimal representations of some classes of dynamic programming
inferredcites →https://doi.org/10.1137/0115060openalex-snapshot
Finite-State Processes and Dynamic Programming
inferredcites →https://doi.org/10.1137/0211004openalex-snapshot
Dynamic Programming is Optimal for Nonserial Optimization Problems
inferredcites →https://doi.org/10.1145/321607.321616openalex-snapshot
Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
inferredcites →https://doi.org/10.1145/322276.322285openalex-snapshot
Dynamic Programming as Graph Searching: An Algebraic Approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_1openalex-snapshot
Dynamic programming: a different perspective
inferred← citeshttps://doi.org/10.1007/978-1-4613-8788-6_2openalex-snapshot
An Algebra for Search Problems and Their Solutions
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bfb0026809openalex-snapshot
A generic program for sequential decision processes
inferred← citeshttps://doi.org/10.1007/s00037-011-0028-yopenalex-snapshot
Toward a Model for Backtracking and Dynamic Programming
inferred← citeshttps://doi.org/10.1007/s00453-009-9385-1openalex-snapshot
A Stronger Model of Dynamic Programming Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-013-9747-6openalex-snapshot
Limitations of Incremental Dynamic Programming
inferred← citeshttps://doi.org/10.1016/0022-247x(86)90147-2openalex-snapshot
The principle of optimality in the design of efficient algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90135-3openalex-snapshot
Dynamic programming with convexity, concavity and sparsity
inferred← citeshttps://doi.org/10.1017/s0960129500000360openalex-snapshot
Categories, relations and dynamic programming
inferred← citeshttps://doi.org/10.1109/24.44173openalex-snapshot
A decomposition scheme for the analysis of fault trees and other combinatorial circuits
inferred← citeshttps://doi.org/10.1145/3664828openalex-snapshot
Polymorphic dynamic programming by algebraic shortcut fusion
inferred← citeshttps://doi.org/10.1145/58562.59304openalex-snapshot
A common schema for dynamic programming and branch and bound algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.