On the public citation graph

Periodically regular chordal rings

0 signed · 49 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.1995.1002openalex-snapshot
Distributed Loop Computer-Networks: A Survey
inferredcites →https://doi.org/10.1006/jpdc.1995.1080openalex-snapshot
Horizons of Parallel Computation
inferredcites →https://doi.org/10.1007/b116777openalex-snapshot
Introduction to Parallel Processing: Algorithms and Architectures
inferredcites →https://doi.org/10.1016/0166-218x(92)90159-8openalex-snapshot
Chordal rings as fault-tolerant loops
inferredcites →https://doi.org/10.1093/comjnl/30.4.298openalex-snapshot
Interval Routing
inferredcites →https://doi.org/10.1109/12.262131openalex-snapshot
Cost-performance trade-offs in Manhattan Street Network versus 2-D torus
inferredcites →https://doi.org/10.1109/12.4617openalex-snapshot
The cubical ring connected cycles: a fault tolerant parallel computation network
inferredcites →https://doi.org/10.1109/2.191995openalex-snapshot
A survey of wormhole routing techniques in direct networks
inferredcites →https://doi.org/10.1109/71.127260openalex-snapshot
Virtual-channel flow control
inferredcites →https://doi.org/10.1109/71.246078openalex-snapshot
Optimal routing algorithm and the diameter of the cube-connected cycles
inferredcites →https://doi.org/10.1109/71.262592openalex-snapshot
Highly reliable symmetric networks
inferredcites →https://doi.org/10.1109/71.466635openalex-snapshot
Ring-connected networks and their relationship to cubical ring connected cycles and dynamic redundancy networks
inferredcites →https://doi.org/10.1109/71.473515openalex-snapshot
A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks
inferredcites →https://doi.org/10.1109/fmpc.1995.380439openalex-snapshot
Periodically regular chordal ring networks for massively parallel architectures
inferredcites →https://doi.org/10.1109/icpp.1993.177openalex-snapshot
The Star Connected Cycles: A Fixed-Degree Network For Parallel Processing
inferredcites →https://doi.org/10.1109/isca.1990.134508openalex-snapshot
Virtual-channel flow control
inferredcites →https://doi.org/10.1109/mascot.1996.501030openalex-snapshot
Comparing the performance parameters of two network structures for scalable massively parallel processors
inferredcites →https://doi.org/10.1109/spdp.1996.570327openalex-snapshot
Periodically regular chordal rings: generality, scalability, and VLSI layout
inferredcites →https://doi.org/10.1109/tc.1981.1675777openalex-snapshot
Analysis of Chordal Ring Network
inferredcites →https://doi.org/10.1109/tc.1984.1676461openalex-snapshot
New Designs for Dense Processor Interconnection Networks
inferredcites →https://doi.org/10.1109/tc.1985.1676514openalex-snapshot
Reliable Loop Topologies for Large Local Computer Networks
inferredcites →https://doi.org/10.1109/tc.1987.1676914openalex-snapshot
Comments on "Reliable Loop Topologies for Large Local Computer Networks"
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1109/tcom.1987.1096802openalex-snapshot
Routing in the Manhattan Street Network
inferredcites →https://doi.org/10.1137/0217042openalex-snapshot
Locality, Communication, and Interconnect Length in Multicomputers
inferredcites →https://doi.org/10.1145/100348.100390openalex-snapshot
Routing for generalized chordal rings
inferredcites →https://doi.org/10.1145/197530.197625openalex-snapshot
The QuickRing network
inferredcites →https://doi.org/10.1145/321832.321838openalex-snapshot
A Combinatorial Problem Related to Multimodule Memory Organizations
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation

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.future.2006.02.016openalex-snapshot
A universal performance factor for multi-criteria evaluation of multistage interconnection networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.03.005openalex-snapshot
On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.11.009openalex-snapshot
Incomplete k-ary n-cube and its derivatives
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.002openalex-snapshot
Swapped interconnection networks: Topological, performance, and robustness attributes
inferred← citeshttps://doi.org/10.1016/j.mcm.2004.10.002openalex-snapshot
Comparing four classes of torus-based parallel architectures: Networkparameters and communication performance
inferred← citeshttps://doi.org/10.1109/empdp.2004.1271430openalex-snapshot
The effect of the degree of multistage interconnection networks on their performance: the case of delta and over-sized delta networks
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750589openalex-snapshot
Efficient VLSI layouts of hypercubic networks
inferred← citeshttps://doi.org/10.1109/icpp.1999.797411openalex-snapshot
Routing and embeddings in cyclic Petersen networks: an efficient extension of the Petersen graph
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213498openalex-snapshot
A study of an evaluation methodology for unbuffered multistage interconnection networks
inferred← citeshttps://doi.org/10.1109/ispan.2000.900286openalex-snapshot
Parametrically described regular semigroup interconnection networks for large-scale multicomputers
inferred← citeshttps://doi.org/10.1109/ispan.2005.85openalex-snapshot
The WK-Recursive Pyramid: An Efficient Network Topology
inferred← citeshttps://doi.org/10.1109/npc.2009.11openalex-snapshot
Network Performance of Pruned Hierarchical Torus Network
inferred← citeshttps://doi.org/10.1109/tpds.2005.96openalex-snapshot
Perfect difference networks and related interconnection structures for parallel and distributed systems
inferred← citeshttps://doi.org/10.1109/tpds.2007.1017openalex-snapshot
[Front cover]
inferred← citeshttps://doi.org/10.1109/tpds.2007.351709openalex-snapshot
Reducing the Height of Independent Spanning Trees in Chordal Rings
inferred← citeshttps://doi.org/10.1142/s0219265908002187openalex-snapshot
PERIODICALLY REGULAR CHORDAL RINGS ARE PREFERABLE TO DOUBLE-RING NETWORKS
inferred← citeshttps://doi.org/10.1142/s1793830912500024openalex-snapshot
A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
inferred← citeshttps://doi.org/10.1145/1066677.1066843openalex-snapshot
The recursive transpose-connected cycles ( RTCC ) interconnection network for multiprocessors
inferred← citeshttps://doi.org/10.1201/9781315219936openalex-snapshot
Design of Cost-Efficient Interconnect Processing Units
inferred← citeshttps://doi.org/10.21303/2461-4262.2021.001734openalex-snapshot
IMPLEMENTATION OF CHORDAL RING NETWORK TOPOLOGY TO ENHANCE THE PERFORMANCE OF WIRELESS BROADBAND 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.