On the public citation graph

Formulas for the width of interval products

0 signed · 30 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/zamm.19710510305openalex-snapshot
Die Subdistributivität der Intervallarithmetik
inferredcites →https://doi.org/10.1002/zamm.19770571215openalex-snapshot
Alefeld, G. / Herzberger, J. , Einführung in die Intervallrechnung, Zürich. B. I.‐Wissenschaftsverlag. 1974. 398 S., DM 22,‐. (Reihe Informatik 12).
inferredcites →https://doi.org/10.1007/bf02238814openalex-snapshot
Die binären Systeme der Intervallarithmetik
inferredcites →https://doi.org/10.1007/bf02241817openalex-snapshot
Linear interval equations
inferredcites →https://doi.org/10.1007/bf02242276openalex-snapshot
Computing the range of values of real functions with accuracy higher than second order
inferredcites →https://doi.org/10.1016/0022-247x(86)90303-3openalex-snapshot
An improved interval Newton operator
inferredcites →https://doi.org/10.1016/0026-2714(92)90270-uopenalex-snapshot
The transistor modeling problem again
inferredcites →https://doi.org/10.1016/c2009-0-21898-8openalex-snapshot
Introduction to Interval Computation
inferredcites →https://doi.org/10.1090/s0025-5718-1983-0701636-9openalex-snapshot
Representations of intervals and optimal error bounds
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0890261-9openalex-snapshot
Abstract Generalized Bisection and a Cost Bound
inferredcites →https://doi.org/10.1093/imanum/2.3.249openalex-snapshot
Further Developments of Rp and Ap Error Analysis
inferredcites →https://doi.org/10.1137/0715024openalex-snapshot
A New Approach to Error Arithmetic
inferredcites →https://doi.org/10.1137/0727047openalex-snapshot
Preconditioners for the Interval Gauss–Seidel Method
inferredcites →https://doi.org/10.1137/0731013openalex-snapshot
Efficient Numerical Validation of Solutions of Nonlinear Systems
inferredcites →https://doi.org/10.2307/2004322openalex-snapshot
Error in Digital Computation
inferredcites →https://doi.org/10.32388/bz83snopenalex-snapshot
Personal Communication

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-30927-6_18openalex-snapshot
Finding the Minimal Root of an Equation
inferred← citeshttps://doi.org/10.1007/978-3-540-68111-3_143openalex-snapshot
Efficient Ray Tracing Using Interval Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-72586-2_24openalex-snapshot
Guaranteed Adaptive Antialiasing Using Interval Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-7908-1823-9_1openalex-snapshot
Interval Arithmetic and Interval Analysis: An Introduction
inferred← citeshttps://doi.org/10.1016/j.amc.2004.10.050openalex-snapshot
Optimal centers in branch-and-prune algorithms for univariate global optimization
inferred← citeshttps://doi.org/10.1533/9780857099518.1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1533/9780857099518.109openalex-snapshot
Intersection Tests
inferred← citeshttps://doi.org/10.1533/9780857099518.13openalex-snapshot
Interval Analysis
inferred← citeshttps://doi.org/10.1533/9780857099518.185openalex-snapshot
The SCCI-Hybrid Method for 2D-Curve Tracing
inferred← citeshttps://doi.org/10.1533/9780857099518.219openalex-snapshot
Interval Versions of Bernstein Polynomials, Bézier Curves and the de Casteljau Algorithm
inferred← citeshttps://doi.org/10.1533/9780857099518.241openalex-snapshot
Robust Computations of Selected Discrete Problems
inferred← citeshttps://doi.org/10.1533/9780857099518.297openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1533/9780857099518.61openalex-snapshot
Interval Newton Methods
inferred← citeshttps://doi.org/10.1533/9780857099518.79openalex-snapshot
The Exact Sign of Sum Algorithm (ESSA)
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.