On the public citation graph
Parallel algorithms for the rounding exact summation of floating point numbers
0 signed · 29 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/978-3-0348-7123-5_1openalex-snapshot
Grundlagen des numerischen Rechnens
inferredcites →https://doi.org/10.1007/978-3-7091-8471-4_3openalex-snapshot
Genaue Summation von Gleitkommazahlen
inferredcites →https://doi.org/10.1007/978-3-7091-8577-3_2openalex-snapshot
Roundings and Approximations in Ordered Sets
inferredcites →https://doi.org/10.1007/bf01404922openalex-snapshot
Correction d'une somme en arithmetique a virgule flottante
inferredcites →https://doi.org/10.1007/bf02243878openalex-snapshot
Concept of a multi-processor parallel processing unit
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-80119-9_21openalex-snapshot
Parallel Accurate and Reproducible Summation
inferred← citeshttps://doi.org/10.1007/978-3-030-95561-8_10openalex-snapshot
An Efficient Summation Algorithm for the Accuracy, Convergence and Reproducibility of Parallel Numerical Methods
inferred← citeshttps://doi.org/10.1007/bf02307378openalex-snapshot
Implicit matrix multiplication with maximum accuracy on various transputer networks
inferred← citeshttps://doi.org/10.1016/0167-8191(85)90027-4openalex-snapshot
Parallel algorithms for rounding exact evaluation of sums of products
inferred← citeshttps://doi.org/10.1016/b978-0-12-428660-3.50017-3openalex-snapshot
FEATURES OF A HARDWARE IMPLEMENTATION OF AN OPTIMAL ARITHMETIC
inferred← citeshttps://doi.org/10.1016/b978-0-12-708245-5.50006-3openalex-snapshot
What Do We Need Beyond IEEE Arithmetic ?
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)62857-xopenalex-snapshot
Bibliography on Enclosure Methods and Related Topics
inferred← citeshttps://doi.org/10.1023/b:numa.0000049458.99541.38openalex-snapshot
Fast and Accurate Floating Point Summation with Application to Computational Geometry
inferred← citeshttps://doi.org/10.1109/12.127445openalex-snapshot
Systolic super summation with reduced hardware
inferred← citeshttps://doi.org/10.1109/arith.1991.145549openalex-snapshot
Algorithms for arbitrary precision floating point arithmetic
inferred← citeshttps://doi.org/10.1109/arith.2007.25openalex-snapshot
Optimistic Parallelization of Floating-Point Accumulation
inferred← citeshttps://doi.org/10.1109/arith.2013.19openalex-snapshot
Accurate Parallel Floating-Point Accumulation
inferred← citeshttps://doi.org/10.1109/ftcs.1988.5317openalex-snapshot
General linear codes for fault-tolerant matrix operations on processor arrays
inferred← citeshttps://doi.org/10.1109/tc.2016.2532874openalex-snapshot
Accurate Parallel Floating-Point Accumulation
inferred← citeshttps://doi.org/10.1137/050645671openalex-snapshot
Accurate Floating-Point Summation Part I: Faithful Rounding
inferred← citeshttps://doi.org/10.1137/0914050openalex-snapshot
The Accuracy of Floating Point Summation
inferred← citeshttps://doi.org/10.1137/s1064827502407627openalex-snapshot
Accurate and Efficient Floating Point Summation
inferred← citeshttps://doi.org/10.1137/s1064827596314200openalex-snapshot
A Distillation Algorithm for Floating-Point Summation
inferred← citeshttps://doi.org/10.1145/2935764.2935779openalex-snapshot
Parallel Algorithms for Summing Floating-Point Numbers
inferred← citeshttps://doi.org/10.56553/popets-2023-0090openalex-snapshot
Secure and Accurate Summation of Many Floating-Point Numbers
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.