On the public citation graph

Unique Extrapolation of Polynomial Recurrences

https://doi.org/10.1137/0217020
0 signed · 28 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/978-1-4684-6726-0_5openalex-snapshot
Positivity and Excess Intersection
inferredcites →https://doi.org/10.1007/978-1-4757-3849-0openalex-snapshot
Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-642-38010-5openalex-snapshot
Basic Algebraic Geometry 2
inferredcites →https://doi.org/10.1007/978-3-662-29244-0openalex-snapshot
Commutative Algebra
inferredcites →https://doi.org/10.1073/pnas.61.1.25openalex-snapshot
RANDOM NUMBERS FALL MAINLY IN THE PLANES
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14532-7openalex-snapshot
Quasi-Monte Carlo methods and pseudo-random numbers
inferredcites →https://doi.org/10.1109/sfcs.1982.73openalex-snapshot
Inferring a sequence generated by a linear congruence
inferredcites →https://doi.org/10.1137/0208040openalex-snapshot
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
inferredcites →https://doi.org/10.1137/0210026openalex-snapshot
An Extension of Strassen’s Degree Bound
inferredcites →https://doi.org/10.1137/0211057openalex-snapshot
Algorithms for the Solution of Systems of Linear Diophantine Equations
inferredcites →https://doi.org/10.1137/0217016openalex-snapshot
Reconstructing Truncated Integer Variables Satisfying Linear Congruences
inferredcites →https://doi.org/10.1137/0402032openalex-snapshot
Identities Satisfied by Iterated Polynomials and $(Q,x)$-Binomial Coefficients
inferredcites →https://doi.org/10.1145/58562.59305openalex-snapshot
Inferring sequences produced by pseudo-random number generators

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119183471.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1006/jagm.1998.0952openalex-snapshot
Design of Practical and Provably Good Random Number Generators
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_14openalex-snapshot
How to Predict Congruential Generators
inferred← citeshttps://doi.org/10.1007/978-3-031-69070-9_18openalex-snapshot
On Rational Recursion for Holonomic Sequences
inferred← citeshttps://doi.org/10.1007/bf02252875openalex-snapshot
Inferring sequences produced by a linear congruential generator missing low-order bits
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90054-gopenalex-snapshot
How to predict congruential generators
inferred← citeshttps://doi.org/10.1016/s0924-6509(04)80025-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1109/5.4443openalex-snapshot
Cryptanalysis: a survey of recent results
inferred← citeshttps://doi.org/10.1109/wsc.1989.718716openalex-snapshot
About Polynomial-Ttime "Unpredictable" Generators
inferred← citeshttps://doi.org/10.1137/0222045openalex-snapshot
Local Randomness in Polynomial Random Number and Random Function Generators
inferred← citeshttps://doi.org/10.1137/0402032openalex-snapshot
Identities Satisfied by Iterated Polynomials and $(Q,x)$-Binomial Coefficients
inferred← citeshttps://doi.org/10.1145/58562.59305openalex-snapshot
Inferring sequences produced by pseudo-random number generators
inferred← citeshttps://doi.org/10.1145/76738.76799openalex-snapshot
About polynomial-time “unpredictable” generators
inferred← citeshttps://doi.org/10.21427/d7rs67openalex-snapshot
A Covert Encryption Method for Applications in Electronic Data Interchange.
inferred← citeshttps://doi.org/10.48550/arxiv.1307.2164openalex-snapshot
Efficiently determining Convergence in Polynomial Recurrence Sequences
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.