On the public citation graph
A parallel method for fast and practical high-order newton interpolation
0 signed · 39 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/bf02243225openalex-snapshot
Parallel Hermite interpolation: An algebraic approach
inferredcites →https://doi.org/10.1007/bf02252904openalex-snapshot
Accuracy and speed of real and complex interpolation
inferredcites →https://doi.org/10.1016/0020-0190(72)90050-6openalex-snapshot
A fast method for interpolation using preconditioning
inferredcites →https://doi.org/10.1016/0167-8191(87)90029-9openalex-snapshot
A stability classification method and its application to pipelined solution of linear recurrences
inferredcites →https://doi.org/10.1016/0771-050x(82)90051-1openalex-snapshot
A comparison of algorithms for polynomial interpolation
inferredcites →https://doi.org/10.1016/0885-064x(89)90018-6openalex-snapshot
Fast computation of divided differences and parallel hermite interpolation
inferredcites →https://doi.org/10.1016/s0022-0000(73)80043-1openalex-snapshot
Optimal algorithms for parallel polynomial evaluation
inferredcites →https://doi.org/10.1016/s0167-8191(84)90435-6openalex-snapshot
Stability aspects in using parallel algorithms
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0258240-xopenalex-snapshot
Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0628707-8openalex-snapshot
Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions
inferredcites →https://doi.org/10.1090/s0025-5718-1989-0969487-3openalex-snapshot
Newton interpolation in Fejér and Chebyshev points
inferredcites →https://doi.org/10.1090/s0025-5718-1991-1094957-9openalex-snapshot
Chebyshev-Vandermonde Systems
inferredcites →https://doi.org/10.1109/t-c.1973.223593openalex-snapshot
On the Parallel Evaluation of Polynomials
inferredcites →https://doi.org/10.1109/tc.1986.1676655openalex-snapshot
A Heuristic for Suffix Solutions
inferredcites →https://doi.org/10.1137/0204009openalex-snapshot
Computational Complexity and Numerical Stability
inferredcites →https://doi.org/10.1137/0215017openalex-snapshot
Logarithmic Depth Circuits for Algebraic Functions
inferredcites →https://doi.org/10.1137/0912034openalex-snapshot
High Degree Polynomial Interpolation in Newton Form
inferredcites →https://doi.org/10.1145/6497.6500openalex-snapshot
Iterated interpolation using a systolic array
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.1201/9780203507643.ch7openalex-snapshot
Interpolation and Approximation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1994.1016openalex-snapshot
Logarithmic Depth Circuits for Hermite Interpolation
inferred← citeshttps://doi.org/10.1007/bf02074881openalex-snapshot
New algorithms for polynomial and trigonometric interpolation on parallel computers
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90027-8openalex-snapshot
A Chebychev-Vandermonde solver
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.04.005openalex-snapshot
Cost-efficient parallel programs based on set-distributions for polynomial interpolation
inferred← citeshttps://doi.org/10.1038/s41598-025-03007-6openalex-snapshot
Reference coordinate based Chan algorithm for UWB personnel localization in underground coal mines
inferred← citeshttps://doi.org/10.1109/hptcdl.2014.9openalex-snapshot
Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof
inferred← citeshttps://doi.org/10.1109/isit.2018.8437549openalex-snapshot
Straggler-Proofing Massive-Scale Distributed Matrix Multiplication with D-Dimensional Product Codes
inferred← citeshttps://doi.org/10.1109/sbac-pad.2014.23openalex-snapshot
Efficient Scan Operator Methods on a GPU
inferred← citeshttps://doi.org/10.1109/tpds.2016.2521373openalex-snapshot
GPU Robot Motion Planning Using Semi-Infinite Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/1037144openalex-snapshot
Parallel Computing Using the Prefix Problem (S. Lakshmivarahan and Sudarshan K. Dhall)
inferred← citeshttps://doi.org/10.1145/2535838.2535882openalex-snapshot
A sound and complete abstraction for reasoning about parallel prefix sums
inferred← citeshttps://doi.org/10.1145/2578855.2535882openalex-snapshot
A sound and complete abstraction for reasoning about parallel prefix sums
inferred← citeshttps://doi.org/10.1590/s1806-92902016000800004openalex-snapshot
Interpolation method for live weight estimation based on age in Japanese quails
inferred← citeshttps://doi.org/10.25560/24437openalex-snapshot
Scalable verification techniques for data-parallel programs
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.