On the public citation graph

On the Robustness of the 2Sum and Fast2Sum Algorithms

https://doi.org/10.1145/3054947
0 signed · 45 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.19740540106openalex-snapshot
Rundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen
inferredcites →https://doi.org/10.1007/978-0-8176-4705-6openalex-snapshot
Handbook of Floating-Point Arithmetic
inferredcites →https://doi.org/10.1007/bf01397083openalex-snapshot
A floating-point technique for extending the available precision
inferredcites →https://doi.org/10.1007/bf01398455openalex-snapshot
An axiomatic approach to rounded computations
inferredcites →https://doi.org/10.1007/bf01975722openalex-snapshot
Quasi double-precision in floating point addition
inferredcites →https://doi.org/10.1007/bf03186531openalex-snapshot
Algorithms for accurate, validated and fast polynomial evaluation
inferredcites →https://doi.org/10.1007/pl00009321openalex-snapshot
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates
inferredcites →https://doi.org/10.1007/s10543-013-0436-2openalex-snapshot
Some issues related to double rounding
inferredcites →https://doi.org/10.1016/j.entcs.2015.10.007openalex-snapshot
Numerical Validation of Compensated Summation Algorithms with Stochastic Arithmetic
inferredcites →https://doi.org/10.1109/arith.1991.145549openalex-snapshot
Algorithms for arbitrary precision floating point arithmetic
inferredcites →https://doi.org/10.1109/arith.2001.930115openalex-snapshot
Algorithms for quad-double precision floating point arithmetic
inferredcites →https://doi.org/10.1109/arith.2003.1207663openalex-snapshot
Representable correcting terms for possibly underflowing floating point operations
inferredcites →https://doi.org/10.1109/arith.2013.9openalex-snapshot
Fast Reproducible Floating-Point Summation
inferredcites →https://doi.org/10.1137/050645671openalex-snapshot
Accurate Floating-Point Summation Part I: Faithful Rounding
inferredcites →https://doi.org/10.1137/07068816xopenalex-snapshot
Accurate Floating-Point Summation Part II: Sign, K -Fold Faithful and Rounding to Nearest
inferredcites →https://doi.org/10.1137/1012065openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms (Donald E. Knuth)
inferredcites →https://doi.org/10.1145/227699.227701openalex-snapshot
Handling floating-point exceptions in numeric programs
inferredcites →https://doi.org/10.1145/363707.363723openalex-snapshot
Pracniques: further remarks on reducing truncation errors
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming

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-030-35713-9_7openalex-snapshot
Dynamic Mode Decomposition—A Numerical Linear Algebra Perspective
inferred← citeshttps://doi.org/10.1007/978-3-030-40616-5_17openalex-snapshot
Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_12openalex-snapshot
Automatic Verification of Floating-Point Accumulation Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-76526-6_4openalex-snapshot
Basic Properties and Algorithms
inferred← citeshttps://doi.org/10.1016/b978-1-78548-112-3.50015-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/s0962492922000101openalex-snapshot
Floating-point arithmetic
inferred← citeshttps://doi.org/10.1080/10618600.2018.1549052openalex-snapshot
Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating
inferred← citeshttps://doi.org/10.1108/jedt-07-2020-0294openalex-snapshot
High-performance computing for computational modelling in built environment-related studies – a scientometric review
inferred← citeshttps://doi.org/10.1109/arith.2018.8464761openalex-snapshot
A Formally-Proved Algorithm to Compute the Correct Average of Decimal Floating-Point Numbers
inferred← citeshttps://doi.org/10.1109/arith.2018.8464813openalex-snapshot
Augmented Arithmetic Operations Proposed for IEEE-754 2018
inferred← citeshttps://doi.org/10.1109/arith.2019.00011openalex-snapshot
Error Bounds for Computer Arithmetics
inferred← citeshttps://doi.org/10.1109/arith51176.2021.00024openalex-snapshot
Algorithms for Stochastically Rounded Elementary Arithmetic Operations in IEEE 754 Floating-Point Arithmetic
inferred← citeshttps://doi.org/10.1109/arith54963.2022.00014openalex-snapshot
The CORE-MATH Project
inferred← citeshttps://doi.org/10.1109/arith64983.2025.00030openalex-snapshot
FastTwoSum revisited
inferred← citeshttps://doi.org/10.1109/tc.2019.2924005openalex-snapshot
Tight Interval Inclusions with Compensated Algorithms
inferred← citeshttps://doi.org/10.1109/tc.2020.3002702openalex-snapshot
Emulating Round-to-Nearest Ties-to-Zero “Augmented” Floating-Point Operations Using Round-to-Nearest Ties-to-Even Arithmetic
inferred← citeshttps://doi.org/10.1109/tetc.2021.3069165openalex-snapshot
Algorithms for Stochastically Rounded Elementary Arithmetic Operations in IEEE 754 Floating-Point Arithmetic
inferred← citeshttps://doi.org/10.1145/3290955openalex-snapshot
Faithfully Rounded Floating-point Computations
inferred← citeshttps://doi.org/10.1145/3544488openalex-snapshot
Toward Accurate and Fast Summation
inferred← citeshttps://doi.org/10.1145/3563353openalex-snapshot
Fast shadow execution for debugging numerical errors using error free transformations
inferred← citeshttps://doi.org/10.1145/3568672openalex-snapshot
Accurate Calculation of Euclidean Norms Using Double-word Arithmetic
inferred← citeshttps://doi.org/10.1145/3712285.3759876openalex-snapshot
High-Performance Branch-Free Algorithms for Extended-Precision Floating-Point Arithmetic
inferred← citeshttps://doi.org/10.1145/3729332openalex-snapshot
Correctly Rounded Math Libraries without Worrying about the Application’s Rounding Mode
inferred← citeshttps://doi.org/10.3390/math13020270openalex-snapshot
Accurate Sum and Dot Product with New Instruction for High-Precision Computing on ARMv8 Processor
inferred← citeshttps://doi.org/10.70675/7f5a49e7z0717z4fb9zb637z67b60612438copenalex-snapshot
Formalisations d’analyses d’erreurs en analyse numérique et en arithmétique à virgule flottante
inferred← citeshttps://doi.org/10.70675/eb63e008z0eefz4ebczb41bz35508a728947openalex-snapshot
Amélioration de la fiabilité numérique de codes de calcul industriels
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.