On the public citation graph
Certified and Fast Computation of Supremum Norms of Approximation Errors
0 signed · 36 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/11814771_35openalex-snapshot
Formal Global Optimisation with Taylor Models
inferredcites →https://doi.org/10.1007/3-540-55602-8_217openalex-snapshot
PVS: A prototype verification system
inferredcites →https://doi.org/10.1007/978-1-4757-2495-0openalex-snapshot
Rigorous Global Search: Continuous Problems
inferredcites →https://doi.org/10.1007/978-3-540-24738-8_4openalex-snapshot
Multiple Precision Interval Packages: Comparing Different Approaches
inferredcites →https://doi.org/10.1007/978-3-540-39901-8_2openalex-snapshot
GlobSol: History, Composition, and Advice on Use
inferredcites →https://doi.org/10.1007/978-3-540-74591-4_9openalex-snapshot
Verifying Nonlinear Real Formulas Via Sums of Squares
inferredcites →https://doi.org/10.1007/bfb0031814openalex-snapshot
HOL Light: A tutorial introduction
inferredcites →https://doi.org/10.1007/s11786-007-0006-6openalex-snapshot
On Effective Analytic Continuation
inferredcites →https://doi.org/10.1016/j.cam.2003.08.015openalex-snapshot
Efficient isolation of polynomial's real roots
inferredcites →https://doi.org/10.1016/j.ic.2011.09.005openalex-snapshot
Floating-point arithmetic in the Coq system
inferredcites →https://doi.org/10.1017/cbo9780511526473openalex-snapshot
Interval Methods for Systems of Equations
inferredcites →https://doi.org/10.1023/b:numa.0000005354.92791.41openalex-snapshot
Interval Newton Iteration in Multiple Precision for the Univariate Case
inferredcites →https://doi.org/10.1090/s0002-9947-02-03013-1openalex-snapshot
Derivations and invariant forms of Jordan and alternative tori
inferredcites →https://doi.org/10.1109/arith.2001.930110openalex-snapshot
Worst cases for correct rounding of the elementary functions in double precision
inferredcites →https://doi.org/10.1109/arith.2005.25openalex-snapshot
Guaranteed Proofs Using Interval Arithmetic
inferredcites →https://doi.org/10.1109/ieeestd.2008.4610935openalex-snapshot
IEEE Standard for Floating-Point Arithmetic
inferredcites →https://doi.org/10.1109/qsic.2007.4385491openalex-snapshot
A Certified Infinite Norm for the Implementation of Elementary Functions
inferredcites →https://doi.org/10.1109/tac.1974.1100629openalex-snapshot
Algorithms for minimization without derivatives
inferredcites →https://doi.org/10.1137/1.9781611970906openalex-snapshot
Methods and Applications of Interval Analysis
inferredcites →https://doi.org/10.1201/9780203026922openalex-snapshot
Global Optimization Using Interval Analysis
inferredcites →https://doi.org/10.1515/9783110944693-002openalex-snapshot
1. Introduction to approximation theory
inferredcites →https://doi.org/10.2307/2005713openalex-snapshot
Algorithms for Minimization Without Derivatives
inferredcites →https://doi.org/10.2307/2153591openalex-snapshot
Global Optimization Using Interval Analysis.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_8openalex-snapshot
Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.052openalex-snapshot
Efficient and accurate computation of upper bounds of approximation errors
inferred← citeshttps://doi.org/10.1109/acssc.2014.7094664openalex-snapshot
A domain splitting algorithm for the mathematical functions code generator
inferred← citeshttps://doi.org/10.1109/arith.2015.22openalex-snapshot
Code Generators for Mathematical Functions
inferred← citeshttps://doi.org/10.1109/asap.2010.5540952openalex-snapshot
Automatic generation of polynomial-based hardware architectures for function evaluation
inferred← citeshttps://doi.org/10.1109/tc.2010.128openalex-snapshot
Certifying the Floating-Point Implementation of an Elementary Function Using Gappa
inferred← citeshttps://doi.org/10.1109/tc.2010.152openalex-snapshot
Computing Floating-Point Square Roots via Bivariate Polynomial Evaluation
inferred← citeshttps://doi.org/10.1145/1837934.1837966openalex-snapshot
Chebyshev interpolation polynomial-based tools for rigorous computing
inferred← citeshttps://doi.org/10.70675/5d5d6196zf00cz4463zbfe0z4e1add495b6aopenalex-snapshot
Towards a modern floating-point environment
inferred← citeshttps://doi.org/10.70675/ef42591ez87aez41afzb2e8z991fe149323dopenalex-snapshot
Rigorous Polynomial Approximations and Applications
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.