On the public citation graph

A reconfiguration scheme for yield enhancement of large area binary tree architectures

0 signed · 31 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.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1109/isscc.1986.1156918openalex-snapshot
Yield statistics for large area ICs
inferredcites →https://doi.org/10.1109/mcd.1985.6311990openalex-snapshot
Point defect yield model for wafer scale integration
inferredcites →https://doi.org/10.1109/tc.1983.1676134openalex-snapshot
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors
inferredcites →https://doi.org/10.1109/tc.1984.1676483openalex-snapshot
Fault Tolerance in Binary Tree Architectures
inferredcites →https://doi.org/10.1109/tc.1985.1676640openalex-snapshot
An Efficient Unsorted VLSI Dictionary Machine
inferredcites →https://doi.org/10.1109/tc.1986.1676770openalex-snapshot
A Fault-Tolerant Modular Architecture for Binary Trees
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
inferredcites →https://doi.org/10.1147/rd.303.0326openalex-snapshot
On yield, fault distributions, and clustering of particles

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-54029-6_181openalex-snapshot
A fault-tolerant binary tree architecture
inferred← citeshttps://doi.org/10.1007/978-1-4757-9957-6_2openalex-snapshot
Yield Models - Comparative Study
inferred← citeshttps://doi.org/10.1007/bf02943138openalex-snapshot
Embedding binary tree in VLSI/WSI processor array
inferred← citeshttps://doi.org/10.1016/0020-0255(94)90047-7openalex-snapshot
Recursive binary tree layout mixing
inferred← citeshttps://doi.org/10.1016/0165-6074(92)90111-jopenalex-snapshot
Fault-tolerant techniques for VLSI tree structures
inferred← citeshttps://doi.org/10.1080/00207219008920361openalex-snapshot
Fault-tolerant tree architecture with improved reconfiguration capabilities
inferred← citeshttps://doi.org/10.1080/00207219208925589openalex-snapshot
Reconfigurable ring connected modular tree architecture
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.312111openalex-snapshot
Reliable butterfly distributed-memory multiprocessors
inferred← citeshttps://doi.org/10.1109/12.372031openalex-snapshot
Fault detection in multiprocessor systems and array processors
inferred← citeshttps://doi.org/10.1109/40.296168openalex-snapshot
Modular fault-tolerant Boolean n-cubes
inferred← citeshttps://doi.org/10.1109/71.80194openalex-snapshot
An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes
inferred← citeshttps://doi.org/10.1109/ftcs.1989.105587openalex-snapshot
A proposal for a fault-tolerant binary hypercube architecture
inferred← citeshttps://doi.org/10.1109/glsv.1991.143938openalex-snapshot
I/O bound binary tree layout
inferred← citeshttps://doi.org/10.1109/iccd.1990.130246openalex-snapshot
An area-efficient reconfigurable binary tree architecture
inferred← citeshttps://doi.org/10.1109/icci.1993.315389openalex-snapshot
On implementing large fault-tolerant binary tree architecture in WSI
inferred← citeshttps://doi.org/10.1109/icwsi.1991.151706openalex-snapshot
Large area defect-tolerant tree architectures
inferred← citeshttps://doi.org/10.1109/iscas.1990.112445openalex-snapshot
Binary tree layouts with adequate I/O support
inferred← citeshttps://doi.org/10.1109/isvd.1991.185126openalex-snapshot
Yield and layout issues in fault tolerant VLSI architectures
inferred← citeshttps://doi.org/10.1109/pccc.1993.344487openalex-snapshot
A reconfigurable modular fault-tolerant binary tree architecture
inferred← citeshttps://doi.org/10.1109/prdc.2000.897298openalex-snapshot
A reconfigurable fault-tolerant hypercube architecture with global sparing
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.