On the public citation graph
A Comment on “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks”
0 signed · 22 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.1109/71.250114openalex-snapshot
A new theory of deadlock-free adaptive routing in wormhole 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/pdp.2010.19openalex-snapshot
A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks
inferredcites →https://doi.org/10.1109/tpds.2011.60openalex-snapshot
On Necessary and Sufficient Conditions for Deadlock-Free Routing in Wormhole Networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11227-015-1428-6openalex-snapshot
Balancing virtual channel utilization for deadlock-free routing in torus networks
inferred← citeshttps://doi.org/10.1007/s11227-015-1597-3openalex-snapshot
Conditional forwarding: simple flow control to increase adaptivity for fully adaptive routing algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-12-800979-6.00006-8openalex-snapshot
Flow control for fully adaptive routing††Part of this research was first presented at the 18th IEEE International Symposium on High Performance Computer Architecture (HPCA-2012) [32]. The journal extension edition of the HPCA-2012 paper was published in IEEE Transactions on Parallel and…
inferred← citeshttps://doi.org/10.1016/j.ijleo.2022.170163openalex-snapshot
Invalidation of tunnelling attacks in ubiquitous IoT & wireless sensor enviroment using ML methods
inferred← citeshttps://doi.org/10.1109/hpca.2012.6169049openalex-snapshot
Whole packet forwarding: Efficient design of fully adaptive routing algorithms for networks-on-chip
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.193openalex-snapshot
VCBR: Virtual Channel Balanced Routing in Torus Networks
inferred← citeshttps://doi.org/10.1109/pdp.2011.23openalex-snapshot
A Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free
inferred← citeshttps://doi.org/10.1109/sbcci.2012.6344433openalex-snapshot
A formally verified deadlock-free routing function in a fault-tolerant NoC architecture
inferred← citeshttps://doi.org/10.1109/tc.2017.2786723openalex-snapshot
A Compositional Approach for Verifying Protocols Running on On-Chip Networks
inferred← citeshttps://doi.org/10.1109/tii.2012.2228873openalex-snapshot
A Joint Design for Distributed Stable Routing and Channel Assignment Over Multihop and Multiflow Mobile Ad Hoc Cognitive Networks
inferred← citeshttps://doi.org/10.1109/tpds.2011.60openalex-snapshot
On Necessary and Sufficient Conditions for Deadlock-Free Routing in Wormhole Networks
inferred← citeshttps://doi.org/10.1109/tpds.2013.121openalex-snapshot
A Decision Procedure for Deadlock-Free Routing in Wormhole Networks
inferred← citeshttps://doi.org/10.1109/tpds.2013.166openalex-snapshot
Novel Flow Control for Fully Adaptive Routing in Cache-Coherent NoCs
inferred← citeshttps://doi.org/10.1145/1999946.1999951openalex-snapshot
Automatic verification for deadlock in Networks-on-Chips with adaptive routing and wormhole switching
inferred← citeshttps://doi.org/10.1145/2071356.2071357openalex-snapshot
Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures
inferred← citeshttps://doi.org/10.4204/eptcs.70openalex-snapshot
Formal verification of a deadlock detection algorithm
inferred← citeshttps://doi.org/10.4204/eptcs.70.8openalex-snapshot
Formal verification of a deadlock detection algorithm
inferred← citeshttps://doi.org/10.5121/ijcnc.2015.7411openalex-snapshot
Broadcast Wormhole-Routed 3-D Mesh 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.