On the public citation graph

A fast parallel algorithm for routing unicast assignments in Benes networks

0 signed · 35 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.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1109/26.129205openalex-snapshot
Performance analysis of a growable architecture for broad-band packet (ATM) switching
inferredcites →https://doi.org/10.1109/5.48833openalex-snapshot
Using the multistage cube network topology in parallel supercomputers
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/tc.1981.1675791openalex-snapshot
A Self-Routing Benes Network and Parallel Permutation Algorithms
inferredcites →https://doi.org/10.1109/tc.1981.6312171openalex-snapshot
A fast parallel algorithm for routing in permutation 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/tcom.1983.1095923openalex-snapshot
Control Algorithms for Rearrangeable Clos Networks
inferredcites →https://doi.org/10.1109/tcom.1986.1096531openalex-snapshot
Comments on "A Simple Algorithm for the Control of Rearrangeable Switching Networks"
inferredcites →https://doi.org/10.1145/321439.321449openalex-snapshot
A Permutation Network
inferredcites →https://doi.org/10.2307/2003526openalex-snapshot
Mathematical Theory of Connecting Networks and Telephone Traffic

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.06.004openalex-snapshot
O(logm¯.logN) routing algorithm for (2logN−1) -stage switching networks and beyond
inferred← citeshttps://doi.org/10.1049/tje2.12037openalex-snapshot
Design and implementation of fast and hardware‐efficient parallel processing elements to set full and partial permutations in Beneš networks
inferred← citeshttps://doi.org/10.1080/17445760601029453openalex-snapshot
Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks
inferred← citeshttps://doi.org/10.1109/aina.2013.55openalex-snapshot
Low Complexity Routing Algorithm for Rearrangeable Switching Networks
inferred← citeshttps://doi.org/10.1109/cicsyn.2009.15openalex-snapshot
Dynamic Path Selection Algorithm for Bene Networks
inferred← citeshttps://doi.org/10.1109/ciss.2007.4298416openalex-snapshot
Quantum Switching Networks with Classical Routing
inferred← citeshttps://doi.org/10.1109/disrta.1999.807725openalex-snapshot
Distributed interactive learning environment
inferred← citeshttps://doi.org/10.1109/icc.1999.765574openalex-snapshot
Bandwidth assignment with QoS guarantee in scalable ATM switches
inferred← citeshttps://doi.org/10.1109/icc.2004.1312666openalex-snapshot
Maximum weight matching dispatching scheme in buffered Clos-network packet switches
inferred← citeshttps://doi.org/10.1109/infcom.1996.497904openalex-snapshot
Parallel routing algorithms in Benes-Clos networks
inferred← citeshttps://doi.org/10.1109/infocom52122.2024.10621315openalex-snapshot
A Parallel Algorithm and Scalable Architecture for Routing in Beneš Networks
inferred← citeshttps://doi.org/10.1109/memcod.2018.8556886openalex-snapshot
Optimal Self-Routing Split Modules for Radix-based Interconnection Networks
inferred← citeshttps://doi.org/10.1109/ps.2009.5307812openalex-snapshot
Design of partially-asynchronous parallel processing elements for setting up Benes networks in O(log2N) time
inferred← citeshttps://doi.org/10.1109/reconfig.2017.8279784openalex-snapshot
Deriving concentrators from binary sorters using half cleaners
inferred← citeshttps://doi.org/10.1109/recosoc.2018.8449372openalex-snapshot
Routing Partial Permutations in Interconnection Networks based on Radix Sorting
inferred← citeshttps://doi.org/10.1109/tcomm.2002.805258openalex-snapshot
Parallel routing algorithms in Benes-Clos networks
inferred← citeshttps://doi.org/10.1109/tnet.2002.804823openalex-snapshot
Concurrent round-robin-based dispatching schemes for Clos-network switches
inferred← citeshttps://doi.org/10.1109/ton.2025.3558552openalex-snapshot
A Parallel Algorithm and Scalable Architecture for Routing in Beneš Networks
inferred← citeshttps://doi.org/10.1142/s0129626418500019openalex-snapshot
The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks
inferred← citeshttps://doi.org/10.1145/3139540.3139546openalex-snapshot
An Efficient Self-Routing and Non-Blocking Interconnection Network on Chip
inferred← citeshttps://doi.org/10.1504/ijhpsa.2017.083645openalex-snapshot
Hardware design of parallel switch setting algorithm for Benes networks
inferred← citeshttps://doi.org/10.1587/transcom.e93.b.297openalex-snapshot
Maximum and Maximal Weight Matching Dispatching Schemes for MSM Clos-Network Packet Switches
inferred← citeshttps://doi.org/10.2478/raft-2019-0019openalex-snapshot
Study of Parallel Algorithms for IP Switches
inferred← citeshttps://doi.org/10.4018/jghpc.2010040105openalex-snapshot
Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks
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.