On the public citation graph

A generic program for sequential decision processes

0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-56625-2_7openalex-snapshot
Solving optimisation problems with catamorphisms
inferredcites →https://doi.org/10.1007/978-3-642-61455-2_12openalex-snapshot
The Algebra of Programming
inferredcites →https://doi.org/10.1007/978-3-642-87374-4_1openalex-snapshot
An Introduction to the Theory of Lists
inferredcites →https://doi.org/10.1007/bf01211316openalex-snapshot
List partitions
inferredcites →https://doi.org/10.1016/0167-6423(90)90025-9openalex-snapshot
Algorithm theories and design tactics
inferredcites →https://doi.org/10.1016/0377-2217(90)90106-lopenalex-snapshot
Efficient parallel algorithms
inferredcites →https://doi.org/10.1126/science.153.3731.34openalex-snapshot
Dynamic Programming
inferredcites →https://doi.org/10.1137/0115060openalex-snapshot
Finite-State Processes and Dynamic Programming
inferredcites →https://doi.org/10.1137/0216043openalex-snapshot
The Least Weight Subsequence Problem
inferredcites →https://doi.org/10.1137/0603055openalex-snapshot
Speed-Up in Dynamic Programming
inferredcites →https://doi.org/10.1137/0606032openalex-snapshot
A Comprehensive Model of Dynamic Programming
inferredcites →https://doi.org/10.1145/146637.146656openalex-snapshot
Sparse dynamic programming II
inferredcites →https://doi.org/10.1145/224164.224212openalex-snapshot
Polytypic pattern matching
inferredcites →https://doi.org/10.1145/224164.224225openalex-snapshot
Bananas in space
inferredcites →https://doi.org/10.1287/moor.8.1.1openalex-snapshot
On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-44806-3_5openalex-snapshot
Generation of Efficient Programs for Solving Maximum Multi-marking Problems
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_19openalex-snapshot
Dynamic Programming via Static Incrementalization
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_73openalex-snapshot
Calculate polytypically!
inferred← citeshttps://doi.org/10.1007/978-1-4020-6585-9_9openalex-snapshot
Dynamic Programming via Static Incrementalization
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_12openalex-snapshot
Dynamic Programming via Thinning and Incrementalization
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_9openalex-snapshot
Functional Pearl: Nearest Shelters in Manhattan
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_7openalex-snapshot
A Short Cut to Optimal Sequences
inferred← citeshttps://doi.org/10.1007/s00354-010-0098-4openalex-snapshot
A Short Cut to Optimal Sequences
inferred← citeshttps://doi.org/10.1016/j.ijar.2019.08.006openalex-snapshot
Sufficient and necessary conditions for solution finding in valuation-based systems
inferred← citeshttps://doi.org/10.1016/j.scico.2014.07.001openalex-snapshot
Approximate by thinning: Deriving fully polynomial-time approximation schemes
inferred← citeshttps://doi.org/10.1017/s0956796801004051openalex-snapshot
Modular lazy search for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1017/s0956796817000156openalex-snapshot
Contributions to a computational theory of policy advice and avoidability
inferred← citeshttps://doi.org/10.1017/s0956796821000204openalex-snapshot
Extensional equality preservation and verified generic programming
inferred← citeshttps://doi.org/10.1017/s0956796821000228openalex-snapshot
On the correctness of monadic backward induction
inferred← citeshttps://doi.org/10.1023/a:1023068020483openalex-snapshot
inferred← citeshttps://doi.org/10.1145/1863495.1863508openalex-snapshot
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning
inferred← citeshttps://doi.org/10.1145/503032.503041openalex-snapshot
Program optimization using indexed and recursive data structures
inferred← citeshttps://doi.org/10.1145/509799.503041openalex-snapshot
Program optimization using indexed and recursive data structures
inferred← citeshttps://doi.org/10.17169/refubium-9458openalex-snapshot
Vulnerability modeling and monadic dynamical systems
inferred← citeshttps://doi.org/10.23638/lmcs-13(1:7)2017openalex-snapshot
Sequential decision problems, dependent types and generic solutions
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.