On the public citation graph
Fault-Tolerant Routing Algorithm for 3D NoC Using Hamiltonian Path Strategy
0 signed · 43 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4614-8274-1_9openalex-snapshot
Reliable and Adaptive Routing Algorithms for 2D and 3D Networks-on-Chip
inferred← citeshttps://doi.org/10.1007/s11227-021-03906-1openalex-snapshot
FT-PDC: an enhanced hybrid congestion-aware fault-tolerant routing technique based on path diversity for 3D NoC
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.06.001openalex-snapshot
The Hamiltonian connectivity of rectangular supergrid graphs
inferred← citeshttps://doi.org/10.1016/j.future.2024.04.019openalex-snapshot
Enabling high fault-tolerant embedding capability of alternating group graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.01.002openalex-snapshot
Graceful deadlock-free fault-tolerant routing algorithm for 3D Network-on-Chip architectures
inferred← citeshttps://doi.org/10.1016/j.vlsi.2015.08.002openalex-snapshot
LOFT: A low-overhead fault-tolerant routing scheme for 3D NoCs
inferred← citeshttps://doi.org/10.1049/iet-cdt.2013.0034openalex-snapshot
Fully adaptive routing algorithms and region‐based approaches for two‐dimensional and three‐dimensional networks‐on‐chip
inferred← citeshttps://doi.org/10.1109/ats.2015.22openalex-snapshot
TWiN: A Turn-Guided Reliable Routing Scheme for Wireless 3D NoCs
inferred← citeshttps://doi.org/10.1109/cads.2013.6714243openalex-snapshot
Fault-tolerant method with distributed monitoring and management technique for 3D stacked meshes
inferred← citeshttps://doi.org/10.1109/ccaa.2016.7813981openalex-snapshot
TARAS: A topology agnostic routing algorithm using segmentation strategy for 3D NoC
inferred← citeshttps://doi.org/10.1109/dft.2016.7684081openalex-snapshot
CoBRA: Low cost compensation of TSV failures in 3D-NoC
inferred← citeshttps://doi.org/10.1109/dft.2018.8602971openalex-snapshot
A Runtime Fault-Tolerant Routing Scheme for Partially Connected 3D Networks-on-Chip
inferred← citeshttps://doi.org/10.1109/hpcc.2014.20openalex-snapshot
HSR: Hierarchical Source Routing Model for Network-on-Chip
inferred← citeshttps://doi.org/10.1109/icawst.2017.8256461openalex-snapshot
The Hamiltonian connectivity of some alphabet supergrid graphs
inferred← citeshttps://doi.org/10.1109/icicm66614.2025.11315927openalex-snapshot
A Fault Tolerant Routing Method for 3D Network on Chip without Redundant TSV or Router-Avoidance
inferred← citeshttps://doi.org/10.1109/ictck.2014.7033493openalex-snapshot
Fault-tolerant circular routing algorithm for 3D-NoC
inferred← citeshttps://doi.org/10.1109/indicon.2015.7443848openalex-snapshot
LBDR3D: Fault tolerant routing scheme for 3D NoCs
inferred← citeshttps://doi.org/10.1109/isvdat.2014.6881040openalex-snapshot
A New Recursive Partitioning Multicast Routing Algorithm for 3D Network-on-Chip
inferred← citeshttps://doi.org/10.1109/isvlsi.2014.56openalex-snapshot
HARS: A High-Performance Reliable Routing Scheme for 3D NoCs
inferred← citeshttps://doi.org/10.1109/itcindia59034.2023.10235563openalex-snapshot
Design of a Fault-Tolerant Pseudo-3D Routing
inferred← citeshttps://doi.org/10.1109/mcsoc.2017.10openalex-snapshot
An Efficient Deadlock-Free Adaptive Routing Algorithm for 3D Network-on-Chips
inferred← citeshttps://doi.org/10.1109/nocs.2016.7579317openalex-snapshot
Logic-based implementation of fault-tolerant routing in 3D network-on-chips
inferred← citeshttps://doi.org/10.1109/recosoc.2015.7238097openalex-snapshot
Reconfigurable communication fabric for efficient implementation of neural networks
inferred← citeshttps://doi.org/10.1109/tc.2016.2532871openalex-snapshot
A Resilient Routing Algorithm with Formal Reliability Analysis for Partially Connected 3D-NoCs
inferred← citeshttps://doi.org/10.1109/tc.2018.2801298openalex-snapshot
LEAD: An Adaptive 3D-NoC Routing Algorithm with Queuing-theory Based Analytical Verification
inferred← citeshttps://doi.org/10.1109/tcad.2019.2917846openalex-snapshot
Addressing a New Class of Reliability Threats in 3-D Network-on-Chips
inferred← citeshttps://doi.org/10.1109/tcad.2024.3399660openalex-snapshot
ReD: A Reliable and Deadlock-Free Routing for 2.5-D Chiplet-Based Interposer Networks
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3553617openalex-snapshot
Link/Switch Fault-Tolerant Hamiltonian Path Embedding in BCube Networks for Deadlock-Free Routing
inferred← citeshttps://doi.org/10.1109/tetc.2024.3387119openalex-snapshot
LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model
inferred← citeshttps://doi.org/10.1109/tnano.2019.2931271openalex-snapshot
FL-RuNS: A High-Performance and Runtime Reconfigurable Fault-Tolerant Routing Scheme for Partially Connected Three-Dimensional Networks on Chip
inferred← citeshttps://doi.org/10.1109/tpds.2023.3264698openalex-snapshot
An Efficient Algorithm for Hamiltonian Path Embedding of $k$-Ary $n$-Cubes under the Partitioned Edge Fault Model
inferred← citeshttps://doi.org/10.1109/tr.2025.3617497openalex-snapshot
Assessing Embedding Capability of Arrangement Graphs From the Perspectives of Partitioned Edge Faults
inferred← citeshttps://doi.org/10.1109/wispnet51692.2021.9419420openalex-snapshot
A Comparative Analysis of Fault Tolerance Methods in 3D-NoC
inferred← citeshttps://doi.org/10.1109/yef-ece.2018.8368935openalex-snapshot
Increasing the efficiency of NOC routing algorithms based on fault tolerance measurement method
inferred← citeshttps://doi.org/10.1145/3414060openalex-snapshot
A Deterministic-Path Routing Algorithm for Tolerating Many Faults on Very-Large-Scale Network-on-Chip
inferred← citeshttps://doi.org/10.1145/3708543openalex-snapshot
Steered Bubble: An Interposer-based Deadlock Recovery Algorithm for Multi-chiplet Systems
inferred← citeshttps://doi.org/10.23919/date.2019.8714948openalex-snapshot
A Deterministic-Path Routing Algorithm for Tolerating Many Faults on Wafer-Level NoC
inferred← citeshttps://doi.org/10.23919/date54114.2022.9774617openalex-snapshot
DeFT: A Deadlock-Free and Fault-Tolerant Routing Algorithm for 2.5D Chiplet Networks
inferred← citeshttps://doi.org/10.3390/electronics12234867openalex-snapshot
RLARA: A TSV-Aware Reinforcement Learning Assisted Fault-Tolerant Routing Algorithm for 3D Network-on-Chip
inferred← citeshttps://doi.org/10.3390/s19245416openalex-snapshot
Maximizing the Inner Resilience of a Network-on-Chip through Router Controllers Design
inferred← citeshttps://doi.org/10.5120/20123-2191openalex-snapshot
FT-Z-OE: A Fault Tolerant and Low Overhead Routing Algorithm on TSV-based 3D Network on Chip Links
inferred← citeshttps://doi.org/10.52547/joc.15.1.113openalex-snapshot
A High Reliable Multicast Routing Algorithm for 2D and 3D Mesh-based NoCs with Fuzzy-based Load Control
inferred← citeshttps://doi.org/10.70675/97cb9b8cz2561z469fzbd15z59543453bd37openalex-snapshot
Synthèse de plateformes d’émulation et évaluation de NoCs pour les systèmes embarqués : vers les réseaux du futur
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.