On the public citation graph
Graph algorithms on a tree-structured parallel computer
0 signed · 21 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.1016/0020-0190(82)90131-4openalex-snapshot
Parallel algorithms for the connected components and minimal spanning tree problems
inferredcites →https://doi.org/10.1016/0196-6774(80)90004-8openalex-snapshot
A parallel algorithm for constructing minimum spanning trees
inferredcites →https://doi.org/10.1016/s0065-2458(08)60033-9openalex-snapshot
The Structure of Parallel Algorithms
inferredcites →https://doi.org/10.1137/0209058openalex-snapshot
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1137/0210051openalex-snapshot
Fast, Efficient Parallel Algorithms for Some Graph Problems
inferredcites →https://doi.org/10.1145/358628.358650openalex-snapshot
Efficient parallel algorithms for some graph problems
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/800070.802210openalex-snapshot
Graph problems on a mesh-connected processor array (Preliminary Version)
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01935049openalex-snapshot
Parallel algorithms for analyzing activity networks
inferred← citeshttps://doi.org/10.1016/0020-0255(86)90013-7openalex-snapshot
Finding fundamental cycles and bridges on a tree-structured parallel computer
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90128-wopenalex-snapshot
Stirling networks: a versatile combinatorial topology for multiprocessor systems
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90041-7openalex-snapshot
Two minimum spanning forest algorithms on fixed-size hypercube computers
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90143-wopenalex-snapshot
Parallel graph algorithms for hypercube computers
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80155-3openalex-snapshot
Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems
inferred← citeshttps://doi.org/10.1016/s0734-189x(86)80059-7openalex-snapshot
Picture processing: 1985
inferred← citeshttps://doi.org/10.1080/00207218708921011openalex-snapshot
Efficient algorithms for some graph problems on a tree-structured parallel computer
inferred← citeshttps://doi.org/10.1080/00207219008921232openalex-snapshot
Parallel algorithm for analysing activity networks on a tree-structured computer
inferred← citeshttps://doi.org/10.1109/31.1744openalex-snapshot
Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
inferred← citeshttps://doi.org/10.1109/71.80177openalex-snapshot
Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems
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.