On the public citation graph
Performing permutations on interconnection networks by regularly changing switch states
0 signed · 47 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.1002/j.1538-7305.1964.tb04103.xopenalex-snapshot
Optimal Rearrangeable Multistage Connecting Networks
inferredcites →https://doi.org/10.1002/j.1538-7305.1968.tb00063.xopenalex-snapshot
On Permutation Switching Networks
inferredcites →https://doi.org/10.1002/j.1538-7305.1971.tb02569.xopenalex-snapshot
On a Class of Rearrangeable Switching Networks Part I: Control Algorithm
inferredcites →https://doi.org/10.1109/71.273043openalex-snapshot
Reconfiguration with time division multiplexed MIN's for multiprocessor communications
inferredcites →https://doi.org/10.1109/71.481594openalex-snapshot
Performance analysis of finite-buffered asynchronous multistage interconnection networks
inferredcites →https://doi.org/10.1109/c-m.1981.220290openalex-snapshot
A Survey of Interconnection Networks
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/t-c.1975.224157openalex-snapshot
Access and Alignment of Data in an Array Processor
inferredcites →https://doi.org/10.1109/tc.1976.5009205openalex-snapshot
A Shuffle-Exchange Network with Simplified Control
inferredcites →https://doi.org/10.1109/tc.1977.1674863openalex-snapshot
The Indirect Binary n-Cube Microprocessor Array
inferredcites →https://doi.org/10.1109/tc.1977.5009294openalex-snapshot
Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks
inferredcites →https://doi.org/10.1109/tc.1978.1675164openalex-snapshot
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
inferredcites →https://doi.org/10.1109/tc.1979.1675280openalex-snapshot
A Model of SIMD Machines and a Comparison of Various 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.1980.1675678openalex-snapshot
The Theory Underlying the Partitioning of Permutation Networks
inferredcites →https://doi.org/10.1109/tc.1980.1675679openalex-snapshot
The Reverse-Exchange Interconnection Network
inferredcites →https://doi.org/10.1109/tc.1981.1675695openalex-snapshot
Performance of Processor-Memory Interconnections for Multiprocessors
inferredcites →https://doi.org/10.1109/tc.1981.1675790openalex-snapshot
The Universality of the Shuffle-Exchange Network
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.1983.1676295openalex-snapshot
Graph Theoretical Analysis and Design of Multistage Interconnection Networks
inferredcites →https://doi.org/10.1109/tc.1985.5009405openalex-snapshot
On Permuting Properties of Regular Rectangular SW-Banyans
inferredcites →https://doi.org/10.1109/tc.1986.1676800openalex-snapshot
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
inferredcites →https://doi.org/10.1109/tc.1987.1676970openalex-snapshot
A New Benes Network Control Algorithm
inferredcites →https://doi.org/10.1109/tc.1987.1676977openalex-snapshot
Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1145/107971.107979openalex-snapshot
A Markov chain approximation for the analysis of banyan networks
inferredcites →https://doi.org/10.1145/107972.107979openalex-snapshot
A Markov chain approximation for the analysis of banyan networks
inferredcites →https://doi.org/10.1145/285930.285972openalex-snapshot
Banyan networks for partitioning multiprocessor systems
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/800094.803052openalex-snapshot
Study of multistage SIMD interconnection networks
inferredcites →https://doi.org/10.1145/800123.803967openalex-snapshot
Banyan networks for partitioning multiprocessor systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_53openalex-snapshot
A “Single-Box” Re-routing Architecture for a 3-Stage Rearrangeable CLOS Interconnection Networks
inferred← citeshttps://doi.org/10.1007/s11107-008-0162-xopenalex-snapshot
Optimizing complexity in Benes-type WDM switching networks
inferred← citeshttps://doi.org/10.1023/a:1016177924700openalex-snapshot
Nonlockability in Multirings and Hypercubes at Serial Transmission of Data Blocks
inferred← citeshttps://doi.org/10.1023/a:1023202717205openalex-snapshot
Nonblockability of Switches with the Cayley Graph Structure for Serial Transfer of Data Blocks. Generalized Hypercubes and Multidimensional Grids
inferred← citeshttps://doi.org/10.1109/chinacom.2006.344827openalex-snapshot
Optimization of Hardware Complexity in Benes-Type WDM Optical Switching Networks
inferred← citeshttps://doi.org/10.1109/glocom.2006.377openalex-snapshot
OPN04-2: On the Design of a 2 logN - 2 WDM Optical Path Cross Connect with Full Permutation Capability
inferred← citeshttps://doi.org/10.1109/hsnmc.2002.1032558openalex-snapshot
A new approach for rerouting of rearrangeable MIN
inferred← citeshttps://doi.org/10.1109/icpads.2004.1316081openalex-snapshot
Routing permutations on optical baseline networks with node-disjoint paths
inferred← citeshttps://doi.org/10.1109/icpads.2004.74openalex-snapshot
Routing permutations on optical baseline networks with node-disjoint paths
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040879openalex-snapshot
Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable networks
inferred← citeshttps://doi.org/10.1109/tpds.2003.1195410openalex-snapshot
Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable interconnects
inferred← citeshttps://doi.org/10.1109/tpds.2005.99openalex-snapshot
Routing permutations on baseline networks with node-disjoint paths
inferred← citeshttps://doi.org/10.26634/jit.6.2.13570openalex-snapshot
Identical And Incremental Routes Availability In Proposed Min Maln And Comparison With Alpha Network
inferred← citeshttps://doi.org/10.3923/jas.2008.2577.2584openalex-snapshot
Grouping Technique for Re-Routing a Rearrangeable MIN
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.