On the public citation graph
Efficient memo-table management strategies
0 signed · 40 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.1007/3-540-10699-5_91openalex-snapshot
The algebra of functional programs: Function level reasoning, linear equations, and extended definitions
inferredcites →https://doi.org/10.1007/bf00263740openalex-snapshot
Algorithms minimizing mean flow time: schedule-length properties
inferredcites →https://doi.org/10.1007/bf00263742openalex-snapshot
A system which automatically improves programs
inferredcites →https://doi.org/10.1007/bf00264597openalex-snapshot
A synthesis of several sorting algorithms
inferredcites →https://doi.org/10.1007/bf01940778openalex-snapshot
Elimination of recursive calls using a small table of “randomly” selected function values
inferredcites →https://doi.org/10.1016/0020-0190(76)90015-6openalex-snapshot
A family of rules for recursion removal
inferredcites →https://doi.org/10.1016/0167-6423(86)90023-7openalex-snapshot
Transformational programming and the paragraph problem
inferredcites →https://doi.org/10.1016/0167-6423(88)90052-4openalex-snapshot
Linearisation: An optimisation for nonlinear functional programs
inferredcites →https://doi.org/10.1016/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1016/c2013-0-05582-xopenalex-snapshot
Elements of Combinatorial Computing
inferredcites →https://doi.org/10.1145/2166.2167openalex-snapshot
Eliminating Redundant Recursive Calls.
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/356827.356831openalex-snapshot
Tabulation Techniques for Recursive Programs
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/359657.359667openalex-snapshot
An example of hierarchical design and proof
inferredcites →https://doi.org/10.1145/359863.359889openalex-snapshot
Improving programs by the introduction of recursion
inferredcites →https://doi.org/10.1145/567752.567766openalex-snapshot
Characterization and elimination of redundancy in recursive programs
inferredcites →https://doi.org/10.1145/69622.357193openalex-snapshot
On the Development of the Algebra of Functional Programs
inferredcites →https://doi.org/10.1145/800055.802023openalex-snapshot
Schema recognition for program transformations
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.
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-44886-1_8openalex-snapshot
Monadic Memoization towards Correctness-Preserving Reduction of Search
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-58485-4_58openalex-snapshot
Mechanical elimination of commutative redundancy
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-07956-1_17openalex-snapshot
Efficient Memoization for Approximate Function Evaluation over Sequence Arguments
inferred← citeshttps://doi.org/10.1016/0164-1212(95)00095-xopenalex-snapshot
Space-efficient memo-functions
inferred← citeshttps://doi.org/10.1016/0167-6423(92)90008-yopenalex-snapshot
Improving recursive functions by inverting the order of evaluation
inferred← citeshttps://doi.org/10.1016/0167-6423(96)00014-7openalex-snapshot
Memoizing purely functional top-down backtracking language processors
inferred← citeshttps://doi.org/10.1016/b978-0-444-89178-5.50118-4openalex-snapshot
FUNCTIONAL SPECIFICATION OF A NEURAL NETWORK**This research was partly sponsored by the Dutch Neural Network Foundation
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.049openalex-snapshot
Approximation of function evaluation over sequence arguments via specialized data structures
inferred← citeshttps://doi.org/10.1017/s0956796800000927openalex-snapshot
An overview of the Flagship system
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
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.