On the public citation graph

Optimal computation of prefix sums on a binary tree of processors

https://doi.org/10.1007/bf01379098
0 signed · 31 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/bf02242186openalex-snapshot
Bit serial addition trees and their applications
inferredcites →https://doi.org/10.1016/c2013-0-10281-4openalex-snapshot
Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1016/s0065-2458(08)60467-2openalex-snapshot
Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1109/tc.1973.5009159openalex-snapshot
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
inferredcites →https://doi.org/10.1109/tc.1983.1676223openalex-snapshot
Binary Trees and Parallel Scheduling Algorithms
inferredcites →https://doi.org/10.1109/tc.1985.6312202openalex-snapshot
The power of parallel prefix
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/322217.322232openalex-snapshot
Parallel Prefix Computation
inferredcites →https://doi.org/10.1145/357114.357116openalex-snapshot
Ultracomputers
inferredcites →https://doi.org/10.1145/800061.808738openalex-snapshot
New bounds for parallel prefix circuits
inferredcites →https://doi.org/10.1147/rd.182.0138openalex-snapshot
Parallel Solution of Recurrence Problems
inferredcites →https://doi.org/10.1201/9781315219271-6openalex-snapshot
Introduction to computer architecture

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.2918openalex-snapshot
Practical trade‐offs for the prefix‐sum problem
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_41openalex-snapshot
Parallel general prefix computations with geometric, algebraic and other applications
inferred← citeshttps://doi.org/10.1007/bf01381719openalex-snapshot
Parallel general prefix computations with geometric, algebraic, and other applications
inferred← citeshttps://doi.org/10.1007/bf01407907openalex-snapshot
Parallel algorithms for line generation
inferred← citeshttps://doi.org/10.1007/bf01573178openalex-snapshot
A chained-matrices approach for parallel computation of continued fractions and its applications
inferred← citeshttps://doi.org/10.1007/s10586-006-9746-3openalex-snapshot
Finding Hamiltonian paths in tournaments on clusters
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00128-yopenalex-snapshot
Parallel algorithms for connectivity problems on interval graphs
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90042-8openalex-snapshot
A cost-optimal parallel tridiagonal system solver
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90009-7openalex-snapshot
Parallel prefix computation with few processors
inferred← citeshttps://doi.org/10.1016/j.protcy.2013.12.438openalex-snapshot
An Improved Parallel Prefix Computation on 2D-Mesh Network
inferred← citeshttps://doi.org/10.1016/s0898-1221(97)00217-4openalex-snapshot
A Local-Sparing Design Methodology for Fault-Tolerant MultiprocessorsaaThis research was supported in part by the Office of Naval Research under Contract N00014-85K0531 and N00014-90J1860, and in part by NSF Grants MIP-9210049 and MIP-9200526.
inferred← citeshttps://doi.org/10.1080/00207169308804209openalex-snapshot
Parallel newton interpolation on mesh-of-unshuffle network
inferred← citeshttps://doi.org/10.1080/10637199308915441openalex-snapshot
OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES
inferred← citeshttps://doi.org/10.1109/71.80139openalex-snapshot
Parallel binary search
inferred← citeshttps://doi.org/10.1109/icpp.1993.61openalex-snapshot
Compiling for Hierarchical Shared Memory Multiprocessors
inferred← citeshttps://doi.org/10.1109/icvd.1995.512070openalex-snapshot
Parallel algorithms for single row routing in narrow streets
inferred← citeshttps://doi.org/10.1109/ssst.1996.493540openalex-snapshot
Prefix computation using a segmented bus
inferred← citeshttps://doi.org/10.1109/tpds.2021.3095230openalex-snapshot
Work-Stealing Prefix Scan: Addressing Load Imbalance in Large-Scale Image Registration
inferred← citeshttps://doi.org/10.1145/508791.508959openalex-snapshot
Grid-enabled parallel divide-and-conquer
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.