On the public citation graph

Elimination of recursive calls using a small table of “randomly” selected function values

https://doi.org/10.1007/bf01940778
0 signed · 17 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.1080/00223980.1953.9712886openalex-snapshot
Institute of Educational Research, Indiana University, Bloomington, Indiana
inferredcites →https://doi.org/10.1214/aoms/1177728547openalex-snapshot
Significance Probabilities of the Wilcoxon Test
inferredcites →https://doi.org/10.2307/2346292openalex-snapshot
Algorithm AS 55: The Generalized Mann-Whitney U-Statistic

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-15975-4_34openalex-snapshot
Lazy memo-functions
inferred← citeshttps://doi.org/10.1007/bf02983374openalex-snapshot
Efficient memo-table management strategies
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90128-2openalex-snapshot
Customizable garbage collectors
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.10.002openalex-snapshot
An enhanced branch-and-bound algorithm for the talent scheduling problem
inferred← citeshttps://doi.org/10.1109/lics.2004.37openalex-snapshot
Self-adjusting computation
inferred← citeshttps://doi.org/10.1145/165593.165596openalex-snapshot
Equal rights for functional objects or, the more things change, the more they are the same
inferred← citeshttps://doi.org/10.1145/195613.195634openalex-snapshot
How to forget the past without repeating it
inferred← citeshttps://doi.org/10.1145/2166.2167openalex-snapshot
Eliminating Redundant Recursive Calls.
inferred← citeshttps://doi.org/10.1145/5001.5004openalex-snapshot
Applicative caching
inferred← citeshttps://doi.org/10.1145/604131.604133openalex-snapshot
Selective memoization
inferred← citeshttps://doi.org/10.1145/62678.62719openalex-snapshot
An improved replacement strategy for function caching
inferred← citeshttps://doi.org/10.1145/640128.604133openalex-snapshot
Selective memoization
inferred← citeshttps://doi.org/10.1145/960114.29657openalex-snapshot
The Illinois functional programming interpreter
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5869openalex-snapshot
An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem
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.