On the public citation graph

Applying Coding Theory to Sparse Interpolation

0 signed · 31 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.1002/9780470519837.ch2openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1007/3-540-17179-7_15openalex-snapshot
Irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1007/978-3-322-96647-6openalex-snapshot
Primality and Cryptography
inferredcites →https://doi.org/10.1007/bfb0067908openalex-snapshot
Coding Theory
inferredcites →https://doi.org/10.1016/0196-8858(91)90004-3openalex-snapshot
The interpolation problem for k-sparse polynomials and character sums
inferredcites →https://doi.org/10.1016/0196-8858(91)90005-4openalex-snapshot
The interpolation problem for k-sparse sums of eigenfunctions of operators
inferredcites →https://doi.org/10.1016/0304-3975(83)90108-1openalex-snapshot
On the complexity of multiplication in finite fields
inferredcites →https://doi.org/10.1016/0304-3975(91)90157-wopenalex-snapshot
On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferredcites →https://doi.org/10.1016/s0019-9958(72)90223-9openalex-snapshot
Codes over certain rings
inferredcites →https://doi.org/10.1016/s0019-9958(75)80001-5openalex-snapshot
Codes over integer residue rings
inferredcites →https://doi.org/10.1016/s0019-9958(77)90526-5openalex-snapshot
Codes over Zm
inferredcites →https://doi.org/10.1016/s0019-9958(78)90461-8openalex-snapshot
Codes over Zm, revisited
inferredcites →https://doi.org/10.1016/s0747-7171(08)80018-1openalex-snapshot
Interpolating polynomials from their values
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.32139openalex-snapshot
A geometric approach to root finding in GT(q/sup m/)
inferredcites →https://doi.org/10.1137/0213050openalex-snapshot
Parallel Algorithms for Algebraic Problems
inferredcites →https://doi.org/10.1137/0219073openalex-snapshot
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4805894openalex-extracted
Almost Optimal Adaptive Proper Learning Polynomials
inferred← citeshttps://doi.org/10.1006/jsco.1999.0255openalex-snapshot
On Shortest Linear Recurrences
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_19openalex-snapshot
Almost Optimal Proper Learning and Testing Polynomials
inferred← citeshttps://doi.org/10.1007/bf01438278openalex-snapshot
The complexity of sparse polynomial interpolation over finite fields
inferred← citeshttps://doi.org/10.1049/iet-ifs.2007.0110openalex-snapshot
Bypassing the decomposition attacks on two-round multivariate schemes by a practical cubic round
inferred← citeshttps://doi.org/10.1109/iccad.2006.320079openalex-snapshot
An Efficient Technique for Synthesis and Optimization of Polynomials in GF(2m)
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508330openalex-snapshot
New interpolation algorithms for multiple-valued Reed-Muller forms
inferred← citeshttps://doi.org/10.1109/tc.2002.1032628openalex-snapshot
A deterministic multivariate interpolation algorithm for small finite fields
inferred← citeshttps://doi.org/10.1109/tc.2007.1060openalex-snapshot
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
inferred← citeshttps://doi.org/10.1109/tcad.2008.917586openalex-snapshot
GfXpress: A Technique for Synthesis and Optimization of $\hbox{GF}(2^{m})$ Polynomials
inferred← citeshttps://doi.org/10.1145/1233501.1233532openalex-snapshot
An efficient technique for synthesis and optimization of polynomials in GF(2m)
inferred← citeshttps://doi.org/10.1145/168304.168307openalex-snapshot
Learning sparse multivariate polynomials over a field with queries and counterexamples
inferred← citeshttps://doi.org/10.1145/309831.309863openalex-snapshot
On feasible multivariate polynomial interpolations over arbitrary fields
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.