On the public citation graph

A theory for total exchange in multidimensional interconnection networks

0 signed · 45 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.1006/jpdc.1997.1353openalex-snapshot
Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures
inferredcites →https://doi.org/10.1006/jpdc.2000.1667openalex-snapshot
Performance Optimization Using Extended Critical Path Analysis in Multithreaded Programs on Multiprocessors
inferredcites →https://doi.org/10.1007/3-540-61626-8_44openalex-snapshot
Total exchange in Cayley networks
inferredcites →https://doi.org/10.1007/978-3-0348-8534-8_21openalex-snapshot
The MPI Message Passing Interface Standard
inferredcites →https://doi.org/10.1016/0141-9331(87)90493-5openalex-snapshot
Deadlock-free message routing in multiprocessor interconnection networks
inferredcites →https://doi.org/10.1016/0166-218x(92)90152-zopenalex-snapshot
Product-shuffle networks: toward reconciling shuffles and butterflies
inferredcites →https://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferredcites →https://doi.org/10.1016/0167-8191(92)90068-iopenalex-snapshot
Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
inferredcites →https://doi.org/10.1016/0743-7315(87)90002-5openalex-snapshot
Communication efficient basic linear algebra computations on hypercube architectures
inferredcites →https://doi.org/10.1016/0743-7315(89)90045-2openalex-snapshot
Data communication in hypercubes
inferredcites →https://doi.org/10.1016/0743-7315(91)90033-6openalex-snapshot
Optimal communication algorithms for hypercubes
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/2.476198openalex-snapshot
Collective communication in wormhole-routed massively parallel computers
inferredcites →https://doi.org/10.1109/71.243525openalex-snapshot
The hyper-deBruijn networks: scalable versatile architecture
inferredcites →https://doi.org/10.1109/71.296314openalex-snapshot
Communication aspects of the star graph interconnection network
inferredcites →https://doi.org/10.1109/71.466633openalex-snapshot
Products of networks with logarithmic diameter and fixed degree
inferredcites →https://doi.org/10.1109/71.485505openalex-snapshot
Folded Petersen cube networks: new competitors for the hypercubes
inferredcites →https://doi.org/10.1109/71.80144openalex-snapshot
The banyan-hypercube networks
inferredcites →https://doi.org/10.1109/88.219857openalex-snapshot
High performance Fortran
inferredcites →https://doi.org/10.1109/ispan.1994.367190openalex-snapshot
Optimal total exchange in linear arrays and rings
inferredcites →https://doi.org/10.1109/mc.1987.1663593openalex-snapshot
The Performance of Multicomputer Interconnection Networks
inferredcites →https://doi.org/10.1109/tc.1984.1676393openalex-snapshot
On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1145/135226.135230openalex-snapshot
Compiling Fortran D for MIMD distributed-memory machines
inferredcites →https://doi.org/10.2307/j.ctv1ddcxfs.13openalex-snapshot
High Performance Fortran
inferredcites →https://doi.org/10.5860/choice.28-0347openalex-snapshot
Distance in graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11945918_23openalex-snapshot
Capturing an Intruder in Product Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69052-8_73openalex-snapshot
Multiphase Data Exchange in Distributed Logic-Algebraic Based Processing
inferred← citeshttps://doi.org/10.1007/978-3-642-13346-6_3openalex-snapshot
Optimal Total Exchange in Anonymous Cayley Graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.06.001openalex-snapshot
All-port total exchange in cartesian product networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.04.013openalex-snapshot
Capturing an intruder in product networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.06.005openalex-snapshot
Resource placement in Cartesian product of networks
inferred← citeshttps://doi.org/10.1023/a:1025765910100openalex-snapshot
Contention-Aware Communication Schedule for High-Speed Communication
inferred← citeshttps://doi.org/10.1109/12.805156openalex-snapshot
Toward optimal complete exchange on wormhole-routed tori
inferred← citeshttps://doi.org/10.1109/71.969126openalex-snapshot
Optimal total exchange in Cayley graphs
inferred← citeshttps://doi.org/10.1109/icpads.1997.652535openalex-snapshot
Proceedings 1997 International Conference on Parallel and Distributed Systems
inferred← citeshttps://doi.org/10.1109/icpp.1996.537138openalex-snapshot
Decomposition of total exchange for multidimensional interconnects
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213166openalex-snapshot
A framework for collective personalized communication
inferred← citeshttps://doi.org/10.1109/pacrim.2001.953526openalex-snapshot
On single-port multinode broadcasting
inferred← citeshttps://doi.org/10.1109/pdcat.2007.19openalex-snapshot
Distant-Based Resource Placement in Product Networks
inferred← citeshttps://doi.org/10.1109/pdcat.2007.32openalex-snapshot
Design and Analysis of a Backpressure Congestion Control Algorithm in Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/tpds.2003.1189580openalex-snapshot
Constructing edge-disjoint spanning trees in product networks
inferred← citeshttps://doi.org/10.1504/ijcnds.2011.040559openalex-snapshot
Single-port and multi-port collective communication operations on single and dual Cell BE processor 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.