On the public citation graph
A unified framework for off-line permutation routing in parallel networks
0 signed · 72 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.1002/j.1538-7305.1953.tb01433.xopenalex-snapshot
A Study of Non-Blocking Switching Networks
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/978-1-4684-0128-8openalex-snapshot
A Course in the Theory of Groups
inferredcites →https://doi.org/10.1007/bf01758834openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferredcites →https://doi.org/10.1007/bfb0040408openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferredcites →https://doi.org/10.1007/bfb0040409openalex-snapshot
Routing and sorting on mesh-connected arrays
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0012-365x(79)90068-2openalex-snapshot
Bounds for sorting by prefix reversal
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/0743-7315(86)90008-0openalex-snapshot
Strategies for interconnection networks: Some methods from graph theory
inferredcites →https://doi.org/10.1016/0743-7315(89)90045-2openalex-snapshot
Data communication in hypercubes
inferredcites →https://doi.org/10.1016/0950-5849(90)90035-popenalex-snapshot
Highly parallel computing
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/tc.1980.1675553openalex-snapshot
Notes on Shuffle/Exchange-Type Switching Networks
inferredcites →https://doi.org/10.1109/tc.1982.1675960openalex-snapshot
Parallel Algorithms to Set Up the Benes Permutation Network
inferredcites →https://doi.org/10.1109/tc.1982.1676021openalex-snapshot
The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems
inferredcites →https://doi.org/10.1109/tc.1985.1676627openalex-snapshot
Interconnection Networks Based on a Generalization of Cube-Connected Cycles
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1137/0219037openalex-snapshot
Group Action Graphs and Parallel Architectures
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/322169.322172openalex-snapshot
An optimal routing algorithm for mesh-connected Parallel computers
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/72935.72955openalex-snapshot
Fault tolerance in hypercube-derivative networks
inferredcites →https://doi.org/10.1145/97444.97450openalex-snapshot
Message-passing algorithms for a SIMD torus with coteries
inferredcites →https://doi.org/10.1145/97444.97457openalex-snapshot
Routing multiple paths in hypercubes
inferredcites →https://doi.org/10.1145/97444.97459openalex-snapshot
Fast algorithms for bit-serial routing on a hypercube
inferredcites →https://doi.org/10.4153/cjm-1982-020-8openalex-snapshot
A Construction for Vertex-Transitive Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20325openalex-snapshot
Optimal permutation routing for low‐dimensional hypercubes
inferred← citeshttps://doi.org/10.1002/net.3230230420openalex-snapshot
Routing permutations on a graph
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1624openalex-snapshot
Routing in a Class of Cayley Graphs of Semidirect Products of Finite Groups
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_4openalex-snapshot
Better parallel architectures via emulations
inferred← citeshttps://doi.org/10.1007/bf01187092openalex-snapshot
An approach to emulating separable graphs
inferred← citeshttps://doi.org/10.1007/bf02090404openalex-snapshot
Routing multiple paths in hypercubes
inferred← citeshttps://doi.org/10.1007/bfb0045067openalex-snapshot
Many-to-one packet routing via matchings
inferred← citeshttps://doi.org/10.1007/bfb0054376openalex-snapshot
Solving fundamental problems on sparse-meshes
inferred← citeshttps://doi.org/10.1007/bfb0097970openalex-snapshot
Permutation routing in all-optical product networks
inferred← citeshttps://doi.org/10.1007/s11390-009-9203-xopenalex-snapshot
Multistage Off-Line Permutation Packet Routing on a Mesh: An Approach with Elementary Mathematics
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90152-zopenalex-snapshot
Product-shuffle networks: toward reconciling shuffles and butterflies
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.024openalex-snapshot
Separator-based graph embedding into multidimensional grids with small edge-congestion
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.11.005openalex-snapshot
A generalized fault-tolerant sorting algorithm on a product network
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00313-xopenalex-snapshot
Two techniques in the area of the star problem in trace monoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00049-2openalex-snapshot
Many-to-many routing on trees via matchings
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00010-9openalex-snapshot
On-line matching routing on trees
inferred← citeshttps://doi.org/10.1016/s0895-7177(99)00173-9openalex-snapshot
A finite automata approach to modeling the cross product of interconnection networks
inferred← citeshttps://doi.org/10.1090/dimacs/021/05openalex-snapshot
Permutation routing via Cayley graphs with an example for bus interconnection networks
inferred← citeshttps://doi.org/10.1109/12.238484openalex-snapshot
Scattering and gathering messages in networks of processors
inferred← citeshttps://doi.org/10.1109/12.509915openalex-snapshot
An empirical study of off-line permutation packet routing on two-dimensional meshes based on the multistage routing method
inferred← citeshttps://doi.org/10.1109/12.628392openalex-snapshot
Efficient VLSI layouts for homogeneous product networks
inferred← citeshttps://doi.org/10.1109/71.466633openalex-snapshot
Products of networks with logarithmic diameter and fixed degree
inferred← citeshttps://doi.org/10.1109/71.553283openalex-snapshot
Mesh-connected trees: a bridge between grids and meshes of trees
inferred← citeshttps://doi.org/10.1109/71.640013openalex-snapshot
Generalized algorithm for parallel sorting on product networks
inferred← citeshttps://doi.org/10.1109/71.642947openalex-snapshot
Sorting, selection, and routing on the array with reconfigurable optical buses
inferred← citeshttps://doi.org/10.1109/81.995673openalex-snapshot
Permutation routing in all-optical product networks
inferred← citeshttps://doi.org/10.1109/iscas.2009.5118418openalex-snapshot
Separator-based graph embedding into higher-dimensional grids with small congestion
inferred← citeshttps://doi.org/10.1109/mppoi.1994.336618openalex-snapshot
Optical interprocessor communication protocols
inferred← citeshttps://doi.org/10.1109/pccc.1995.472483openalex-snapshot
Shortest path routing in a class of Cayley graphs of semi-direct product of finite groups
inferred← citeshttps://doi.org/10.1137/090776317openalex-snapshot
Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes
inferred← citeshttps://doi.org/10.1137/s0895480192236628openalex-snapshot
Routing Permutations on Graphs via Matchings
inferred← citeshttps://doi.org/10.1137/s0895480197323159openalex-snapshot
Optimal Bounds for Matching Routing on Trees
inferred← citeshttps://doi.org/10.1145/167088.167239openalex-snapshot
Routing permutations on graphs via matchings
inferred← citeshttps://doi.org/10.1145/97444.97457openalex-snapshot
Routing multiple paths in hypercubes
inferred← citeshttps://doi.org/10.5555/314161.314340openalex-snapshot
Optimal bounds for matching routing on trees
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.