On the public citation graph
On designing and reconfiguring k-fault-tolerant tree architectures
0 signed · 61 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/net.3230120303openalex-snapshot
An optimal 2‐FT realization of binary symmetric hierarchical tree systems
inferredcites →https://doi.org/10.1109/cmpsac.1978.810397openalex-snapshot
A distributed multiprocessor traffic control system
inferredcites →https://doi.org/10.1109/ftcs.1988.5339openalex-snapshot
Design and reconfiguration strategies for near-optimal k-fault-tolerant tree architectures
inferredcites →https://doi.org/10.1109/ftcsh.1995.532614openalex-snapshot
Design and Reconfiguration Strategies for Near-Optimal k-fault-tolerant Tree Architectures
inferredcites →https://doi.org/10.1109/tc.1976.1674712openalex-snapshot
A Graph Model for Fault-Tolerant Computing Systems
inferredcites →https://doi.org/10.1109/tc.1981.1675772openalex-snapshot
The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI
inferredcites →https://doi.org/10.1109/tc.1984.1676483openalex-snapshot
Fault Tolerance in Binary Tree Architectures
inferredcites →https://doi.org/10.1109/tc.1986.1676668openalex-snapshot
Comments on "The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors"
inferredcites →https://doi.org/10.1109/tc.1986.1676678openalex-snapshot
Distributed Recovery in Fault-Tolerant Multiprocessor Networks
inferredcites →https://doi.org/10.1109/tc.1987.1676858openalex-snapshot
Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance
inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot
Multidimensional Binary Search Trees in Database Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200003)35:2<157::aid-net6>3.0.co;2-copenalex-snapshot
Optimal fault-tolerant networks with a server
inferred← citeshttps://doi.org/10.1007/3-540-58426-9_157openalex-snapshot
Fault-tolerance on boolean n-cube architectures
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90171-6openalex-snapshot
Tolerating faults in a mesh with a row of spare nodes
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90129-wopenalex-snapshot
Designing fault-tolerant systems using automorphisms
inferred← citeshttps://doi.org/10.1016/b978-012170960-0/50034-7openalex-snapshot
Fault Tolerance in Computer Systems—From Circuits to Algorithms**This work was supported in part by the U.S. Department of Defense under the MURI grant F49620-01-1-0436.
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00090-xopenalex-snapshot
Catastrophic faults in reconfigurable systolic linear arrays
inferred← citeshttps://doi.org/10.1016/s0898-1221(97)00217-4openalex-snapshot
A Local-Sparing Design Methodology for Fault-Tolerant MultiprocessorsaaThis research was supported in part by the Office of Naval Research under Contract N00014-85K0531 and N00014-90J1860, and in part by NSF Grants MIP-9210049 and MIP-9200526.
inferred← citeshttps://doi.org/10.1023/a:1026235604866openalex-snapshot
An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability
inferred← citeshttps://doi.org/10.1109/12.142685openalex-snapshot
Some practical issues in the design of fault-tolerant multiprocessors
inferred← citeshttps://doi.org/10.1109/12.177316openalex-snapshot
Design and analysis of a generalized architecture for reconfigurable m-ary tree structures
inferred← citeshttps://doi.org/10.1109/12.241598openalex-snapshot
Fault-tolerant meshes and hypercubes with minimal numbers of spares
inferred← citeshttps://doi.org/10.1109/12.241602openalex-snapshot
Yield analysis of reconfigurable array processors based on multiple-level redundancy
inferred← citeshttps://doi.org/10.1109/12.277283openalex-snapshot
Reliability, reconfiguration, and spare allocation issues in binary-tree architectures based on multiple-level redundancy
inferred← citeshttps://doi.org/10.1109/12.620481openalex-snapshot
Node-covering, error-correcting codes and multiprocessors with very high average fault tolerance
inferred← citeshttps://doi.org/10.1109/12.859538openalex-snapshot
Fault-tolerant processor arrays using additional bypass linking allocated by Graph-Node coloring
inferred← citeshttps://doi.org/10.1109/49.105167openalex-snapshot
A reconfigurable ATM switch fabric for fault tolerance and traffic balancing
inferred← citeshttps://doi.org/10.1109/71.282566openalex-snapshot
Fault-tolerant de Bruijn and shuffle-exchange networks
inferred← citeshttps://doi.org/10.1109/71.755822openalex-snapshot
Fault-free Hamiltonian cycles in faulty arrangement graphs
inferred← citeshttps://doi.org/10.1109/71.910866openalex-snapshot
Computing in the RAIN: a reliable array of independent nodes
inferred← citeshttps://doi.org/10.1109/92.555985openalex-snapshot
REMOD: a new methodology for designing fault-tolerant arithmetic circuits
inferred← citeshttps://doi.org/10.1109/aero.2000.878500openalex-snapshot
Graph-theoretic fault tolerance for spacecraft bus avionics
inferred← citeshttps://doi.org/10.1109/aspdac.2017.7858361openalex-snapshot
A local reconfiguration based scalable fault tolerant many-processor array
inferred← citeshttps://doi.org/10.1109/dftvs.2000.886972openalex-snapshot
VLSI yield optimization based on the sub-processing-element level redundancy
inferred← citeshttps://doi.org/10.1109/ftcs.1991.146676openalex-snapshot
Some practical issues in the design of fault-tolerant multiprocessors
inferred← citeshttps://doi.org/10.1109/ftcs.1992.243604openalex-snapshot
Efficient fault-tolerant mesh and hypercube architectures
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466967openalex-snapshot
Node covering, error correcting codes and multiprocessors with very high average fault tolerance
inferred← citeshttps://doi.org/10.1109/ftcs.1996.535880openalex-snapshot
Hardware-efficient and highly-reconfigurable 4- and 2-track fault-tolerant designs for mesh-connected multicomputers
inferred← citeshttps://doi.org/10.1109/iccd.2015.7357130openalex-snapshot
On the conditions of guaranteed k-fault tolerant systems supporting on-the-fly repairs
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183447openalex-snapshot
Tensor product modeling of fault tolerant multiprocessor architectures
inferred← citeshttps://doi.org/10.1109/icwsi.1991.151708openalex-snapshot
Reconfiguration of binary trees: the flow-driven approach
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016530openalex-snapshot
Survivable computer networks in the presence of partitioning
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213391openalex-snapshot
Failure margin and performance degradation in "F-Cycle ring" networks
inferred← citeshttps://doi.org/10.1109/ipdps.2005.61openalex-snapshot
A Proxy-Network Based Overlay Topology Resistant to DoS Attacks and Partitioning
inferred← citeshttps://doi.org/10.1109/ipps.1997.580847openalex-snapshot
Gracefully degradable pipeline networks
inferred← citeshttps://doi.org/10.1109/ipps.1998.670011openalex-snapshot
Fault-tolerant switched local area networks
inferred← citeshttps://doi.org/10.1109/ispan.1994.367145openalex-snapshot
Cost-effective global fault-tolerant multiprocessors
inferred← citeshttps://doi.org/10.1109/nca.2006.8openalex-snapshot
A Proxy Network Topology and Reconfiguration Algorithm for Resistance to DoS Attacks
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267781openalex-snapshot
Fault tolerant graphs, perfect hash functions and disjoint paths
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267797openalex-snapshot
On the fault tolerance of some popular bounded-degree networks
inferred← citeshttps://doi.org/10.1109/snpd-sawn.2006.70openalex-snapshot
The global fault-tolerance of interconnection networks
inferred← citeshttps://doi.org/10.1109/spdp.1991.218267openalex-snapshot
Fault-tolerant meshes with minimal numbers of spares
inferred← citeshttps://doi.org/10.1109/spdp.1992.242768openalex-snapshot
Tolerating faults in a mesh with a row of spare nodes
inferred← citeshttps://doi.org/10.1109/spdp.1993.395455openalex-snapshot
Fast polylog-time reconfiguration of structurally fault-tolerant multiprocessors
inferred← citeshttps://doi.org/10.1109/tc.2003.1190592openalex-snapshot
What designers of bus and network architectures should know about hypercubes
inferred← citeshttps://doi.org/10.1137/s0097539793255163openalex-snapshot
On the Fault Tolerance of Some Popular Bounded-Degree Networks
inferred← citeshttps://doi.org/10.1137/s0097539794274994openalex-snapshot
Fault-Tolerant Meshes with Small Degree
inferred← citeshttps://doi.org/10.1145/165231.165232openalex-snapshot
Fault-tolerant meshes with small degree
inferred← citeshttps://doi.org/10.1145/181014.181407openalex-snapshot
Construction of the mesh and the torus tolerating a large number of faults
inferred← citeshttps://doi.org/10.70675/03a33e82zc587z4a58z86c1zefe5d03c8af7openalex-snapshot
Decomposition and Domination of Some Graphs
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.