On the public citation graph
On partitioning and mapping for hypercube computing
0 signed · 23 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/bf00127846openalex-snapshot
Efficient mapping and implementation of matrix algorithms on a hypercube
inferredcites →https://doi.org/10.1016/0167-8191(87)90060-3openalex-snapshot
Matrix algorithms on a hypercube I: Matrix multiplication
inferredcites →https://doi.org/10.1109/2.73openalex-snapshot
Multicomputers: message-passing concurrent computers
inferredcites →https://doi.org/10.1109/cmpcon.1988.4835openalex-snapshot
Programming and performance on a cube-connected architecture
inferredcites →https://doi.org/10.1109/ms.1985.231374openalex-snapshot
Parallel Processing in a Message-Based operating System
inferredcites →https://doi.org/10.1109/tc.1979.1675348openalex-snapshot
Assignment of Tasks in a Distributed Processor System with Limited Memory
inferredcites →https://doi.org/10.1109/tc.1982.1675884openalex-snapshot
A Task Allocation Model for Distributed Computing Systems
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1145/55364.55402openalex-snapshot
Pipelined data parallel algorithms---concept and modeling
inferredcites →https://doi.org/10.1145/62297.62377openalex-snapshot
Networks for parallel processors: measurements and prognostications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1117openalex-snapshot
Efficient Algorithms for Mapping and Partitioning a Class of Parallel Computations
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90001-nopenalex-snapshot
Load balanced tree embeddings
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90064-ropenalex-snapshot
Hypercube matrix multiplication
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90031-hopenalex-snapshot
Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers
inferred← citeshttps://doi.org/10.1016/0893-9659(93)90149-hopenalex-snapshot
Summing up function values in parallel: A complexity analysis
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80053-5openalex-snapshot
Downloading node programs/data into hypercubes
inferred← citeshttps://doi.org/10.1109/71.80175openalex-snapshot
Pipelined data parallel algorithms-I: concept and modeling
inferred← citeshttps://doi.org/10.1109/71.80176openalex-snapshot
Pipelined data parallel algorithms-II: design
inferred← citeshttps://doi.org/10.1109/icdcs.1992.235048openalex-snapshot
Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers
inferred← citeshttps://doi.org/10.1109/pccc.1990.101604openalex-snapshot
A two-scan algorithm and architecture to a root for morphological filters
inferred← citeshttps://doi.org/10.1109/spdp.1993.395474openalex-snapshot
On the furthest-distance-first principle for data scattering with set-up
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.