On the public citation graph
An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks
0 signed · 27 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.1016/0141-9331(85)90187-5openalex-snapshot
Computer architecture and parallel processing
inferredcites →https://doi.org/10.1109/12.16509openalex-snapshot
On the number of permutations performable by extra-stage multistage interconnection networks
inferredcites →https://doi.org/10.1109/12.376176openalex-snapshot
An optimal algorithm for permutation admissibility to multistage interconnection networks
inferredcites →https://doi.org/10.1109/26.103045openalex-snapshot
Log/sub 2/ (N, m, p) strictly nonblocking networks
inferredcites →https://doi.org/10.1109/26.87179openalex-snapshot
Tradeoff of horizontal decomposition versus vertical stacking in rearrangeable nonblocking networks
inferredcites →https://doi.org/10.1109/tc.1977.1674863openalex-snapshot
The Indirect Binary n-Cube Microprocessor Array
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.1675651openalex-snapshot
On a Class of Multistage Interconnection Networks
inferredcites →https://doi.org/10.1109/tc.1980.1675677openalex-snapshot
A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD Machines
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.1675901openalex-snapshot
Star: A Local Network System for Real-Time Management of Imagery Data
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.1983.1676295openalex-snapshot
Graph Theoretical Analysis and Design of Multistage Interconnection Networks
inferredcites →https://doi.org/10.1109/tc.1985.1676581openalex-snapshot
On the Rearrangeability of 2(Iog2N) –1 Stage Permutation Networks
inferredcites →https://doi.org/10.1109/tc.1986.1676763openalex-snapshot
Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
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.1999.1603openalex-snapshot
Partitionability of k-Extra-Stage Omega Networks and an Optimal Task Migration Algorithm
inferred← citeshttps://doi.org/10.1007/s00236-008-0084-1openalex-snapshot
Exploiting colored Petri nets to decide on permutation admissibility
inferred← citeshttps://doi.org/10.1016/j.ins.2009.11.017openalex-snapshot
On path dependent loss and switch crosstalk reduction in optical networks
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.08.001openalex-snapshot
More on rearrangeability of combined (2n−1)-stage networks
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00013-4openalex-snapshot
Permutation routing in optical MIN with minimum number of stages
inferred← citeshttps://doi.org/10.1080/00207729708929477openalex-snapshot
GSE: a full-access multistage interconnection network of arbitrary size
inferred← citeshttps://doi.org/10.1109/12.381960openalex-snapshot
Optimal realization of any BPC permutation on K-extra-stage Omega networks
inferred← citeshttps://doi.org/10.1109/12.481490openalex-snapshot
Optimally routing LC permutations on k-extra-stage cube-type networks
inferred← citeshttps://doi.org/10.1109/90.944348openalex-snapshot
Equivalent permutation capabilities between time-division optical Omega networks and non-optical extra-stage Omega networks
inferred← citeshttps://doi.org/10.1109/hipc.1996.565820openalex-snapshot
GSE: a generalized full-access multistage interconnection network with minimum cost
inferred← citeshttps://doi.org/10.1109/hipc.1998.737998openalex-snapshot
Permutation admissibility in shuffle-exchange networks with arbitrary number of stages
inferred← citeshttps://doi.org/10.1109/pccc.1999.749459openalex-snapshot
Equivalent permutation capabilities between time division optical omega network and non-optical extra stage omega network
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.