On the public citation graph

Algorithms for Efficient Reproducible Floating Point Summation

https://doi.org/10.1145/3389360
0 signed · 41 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.1007/978-3-319-31769-4_11openalex-snapshot
Reproducible and Accurate Matrix Multiplication
inferredcites →https://doi.org/10.1007/978-3-319-31769-4_8openalex-snapshot
Efficiency of Reproducible Level 1 BLAS
inferredcites →https://doi.org/10.1007/978-3-319-58943-5_49openalex-snapshot
Reproducible, Accurately Rounded and Efficient BLAS
inferredcites →https://doi.org/10.1007/978-3-319-76526-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.1016/j.parco.2015.09.001openalex-snapshot
Numerical reproducibility for the parallel reduction on multi- and many-core architectures
inferredcites →https://doi.org/10.1109/arith.1991.145558openalex-snapshot
Integer division using reciprocals
inferredcites →https://doi.org/10.1109/ieeestd.2008.4610935openalex-snapshot
IEEE Standard for Floating-Point Arithmetic
inferredcites →https://doi.org/10.1109/ieeestd.2019.8766229openalex-snapshot
IEEE Standard for Floating-Point Arithmetic
inferredcites →https://doi.org/10.1109/mc.2019.2926614openalex-snapshot
The IEEE Standard 754: One for the History Books
inferredcites →https://doi.org/10.1109/tc.2014.2345391openalex-snapshot
Parallel Reproducible Summation
inferredcites →https://doi.org/10.1137/080738490openalex-snapshot
Ultimately Fast Accurate Summation
inferredcites →https://doi.org/10.1137/0914050openalex-snapshot
The Accuracy of Floating Point Summation
inferredcites →https://doi.org/10.1137/1.9780898718027openalex-snapshot
Accuracy and Stability of Numerical Algorithms
inferredcites →https://doi.org/10.1137/s1064827502407627openalex-snapshot
Accurate and Efficient Floating Point Summation
inferredcites →https://doi.org/10.1145/1283920.1283929openalex-snapshot
Computer programming as an art
inferredcites →https://doi.org/10.1145/178243.178249openalex-snapshot
Division by invariant integers using multiplication
inferredcites →https://doi.org/10.1145/363707.363723openalex-snapshot
Pracniques: further remarks on reducing truncation errors
inferredcites →https://doi.org/10.1587/nolta.1.2openalex-snapshot
Fast high precision summation
inferredcites →https://doi.org/10.2307/2669725openalex-snapshot
Accuracy and Stability of Numerical Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.7763openalex-snapshot
Improving accuracy of summation using parallel vectorized Kahan's and Gill‐Møller algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-77961-0_61openalex-snapshot
Error Estimation and Correction Using the Forward CENA Method
inferred← citeshttps://doi.org/10.1007/978-3-031-30445-3_6openalex-snapshot
Parallel Vectorized Implementations of Compensated Summation Algorithms
inferred← citeshttps://doi.org/10.1007/s42514-023-00150-2openalex-snapshot
ddRingAllreduce: a high-precision RingAllreduce algorithm
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2026.109615openalex-snapshot
Reproducibility of GPU-based Large Eddy Simulations for mixing in stirred tank reactors
inferred← citeshttps://doi.org/10.1016/j.parco.2023.102996openalex-snapshot
Multi-level parallel multi-layer block reproducible summation algorithm
inferred← citeshttps://doi.org/10.1088/2632-2153/ae696bopenalex-snapshot
Determinism analysis in Hybrid-LLM-GNN modeling for materials property prediction
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad164openalex-snapshot
mlf-core: a framework for deterministic machine learning
inferred← citeshttps://doi.org/10.1093/bioinformatics/btag044openalex-snapshot
Bit-reproducible parallel phylogenetic tree inference
inferred← citeshttps://doi.org/10.1101/2025.06.02.656320openalex-snapshot
Bit-Reproducible Phylogenetic Tree Inference under Varying Core-Counts via Reproducible Parallel Reduction Operators
inferred← citeshttps://doi.org/10.1109/arith61463.2024.00015openalex-snapshot
Useful applications of correctly-rounded operators of the form ab + cd + e
inferred← citeshttps://doi.org/10.1109/correctness56720.2022.00006openalex-snapshot
Proposed Consistent Exception Handling for the BLAS and LAPACK
inferred← citeshttps://doi.org/10.1109/nano61778.2024.10628939openalex-snapshot
Integration of Posit Arithmetic in RISC-V Targeting Low-Power Computations
inferred← citeshttps://doi.org/10.1109/scw63240.2024.00028openalex-snapshot
Impacts of floating-point non-associativity on reproducibility for HPC and deep learning applications
inferred← citeshttps://doi.org/10.1137/24m165096xopenalex-snapshot
Verified Error Bounds for Matrix Decompositions
inferred← citeshttps://doi.org/10.1142/s0129626426500027openalex-snapshot
Recursive Vectorized Computation of the Vector p -norm
inferred← citeshttps://doi.org/10.1145/3578178.3578234openalex-snapshot
Comparison of Reproducible Parallel Preconditioned BiCGSTAB Algorithm Based on ExBLAS and ReproBLAS
inferred← citeshttps://doi.org/10.1145/3624062.3624256openalex-snapshot
Asynchronous Multi-Level Checkpointing: An Enabler of Reproducibility using Checkpoint History Analytics
inferred← citeshttps://doi.org/10.1145/3652892.3700780openalex-snapshot
Towards Affordable Reproducibility Using Scalable Capture and Comparison of Intermediate Multi-Run Results
inferred← citeshttps://doi.org/10.1145/3747840openalex-snapshot
Correctly Rounded Evaluation of a Function: Why, How, and at What Cost?
inferred← citeshttps://doi.org/10.70675/190913fczdf29z490czbabbz568f84166131openalex-snapshot
Optimisation de la précision numérique des codes parallèles
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.