On the public citation graph

Efficient algorithms for reconfiguration in VLSI/WSI arrays

0 signed · 98 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.1007/978-1-4613-1625-1openalex-snapshot
Wafer-Level Integrated Systems
inferredcites →https://doi.org/10.1016/0196-6774(92)90060-popenalex-snapshot
On finding non-intersecting straightline connections of grid points to the boundary
inferredcites →https://doi.org/10.1109/12.21143openalex-snapshot
Fault-tolerant array processors using single-track switches
inferredcites →https://doi.org/10.1109/12.54841openalex-snapshot
Efficient algorithms for reconfiguration in VLSI/WSI arrays
inferredcites →https://doi.org/10.1109/43.35547openalex-snapshot
Reconfiguration of VLSI arrays by covering
inferredcites →https://doi.org/10.1109/massp.1985.1163741openalex-snapshot
VLSI Array processors
inferredcites →https://doi.org/10.1109/mc.1982.1653826openalex-snapshot
Introduction to the configurable, highly parallel computer
inferredcites →https://doi.org/10.1109/proc.1986.13531openalex-snapshot
A review of fault-tolerant techniques for the enhancement of integrated circuit yield
inferredcites →https://doi.org/10.1109/proc.1986.13533openalex-snapshot
Reconfigurable architectures for VLSI processing arrays
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
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.1985.1676584openalex-snapshot
Wafer-Scale Integration of Systolic Arrays
inferredcites →https://doi.org/10.1109/wafer.1989.47570openalex-snapshot
Necessary and sufficient conditions for reconfigurability in single-track switch WSI arrays
inferredcites →https://doi.org/10.1145/1634.2377openalex-snapshot
Configuration of VLSI Arrays in the Presence of Defects
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.

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)1520-684x(199708)28:8<8::aid-scj2>3.0.co;2-iopenalex-snapshot
The effect of hardware needed for redundant interconnection lines and exchanging switches on the yield of VLSI chips with redundancy
inferred← citeshttps://doi.org/10.1002/ecjc.4430791109openalex-snapshot
A study of the number of tracks required for the reconfiguration of mesh‐connected processor‐element networks
inferred← citeshttps://doi.org/10.1006/jagm.1999.1054openalex-snapshot
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1012openalex-snapshot
Channel Multiplexing in Fault-Tolerant Modular Multiprocessors
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_40openalex-snapshot
A Faster Algorithm for Finding Disjoint Paths in Grids
inferred← citeshttps://doi.org/10.1007/3-540-60294-1_132openalex-snapshot
Reconfigurable logic for fault tolerance
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_83openalex-snapshot
Efficient breakout routing in printed circuit boards
inferred← citeshttps://doi.org/10.1007/978-1-4615-6281-8_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-662-50412-3_7openalex-snapshot
A Built-in Self-repair Circuit for Restructuring Mesh-Connected Processor Arrays by Direct Spare Replacement
inferred← citeshttps://doi.org/10.1007/978-3-662-59958-7_7openalex-snapshot
A Built-In Circuit for Self-reconfiguring Mesh-Connected Processor Arrays with Spares on Diagonal
inferred← citeshttps://doi.org/10.1007/978-3-662-63170-6_3openalex-snapshot
Self-restructuring of Mesh-Connected Processor Arrays with Spares Assigned on Rotated Orthogonal Side
inferred← citeshttps://doi.org/10.1007/978-3-662-66491-9_1openalex-snapshot
Degradable Self-restructuring of Processor Arrays by Direct Spare Replacement
inferred← citeshttps://doi.org/10.1007/978-981-96-1539-1_6openalex-snapshot
Three Dimensional Arrays
inferred← citeshttps://doi.org/10.1007/bf00930643openalex-snapshot
A resource-efficient reconfiguration algorithm of VLSI 2-D processor arrays
inferred← citeshttps://doi.org/10.1007/bf00936905openalex-snapshot
New algorithms for reconfiguring VLSI/WSI arrays
inferred← citeshttps://doi.org/10.1007/bf01240733openalex-snapshot
Flow in planar graphs with vertex capacities
inferred← citeshttps://doi.org/10.1007/s00453-003-1023-8openalex-snapshot
Escaping a Grid by Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1016/0026-2714(91)90041-5openalex-snapshot
Architectural factors influencing the reliability of fault-tolerant VLSI arrays
inferred← citeshttps://doi.org/10.1016/0167-9260(93)90049-iopenalex-snapshot
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays
inferred← citeshttps://doi.org/10.1016/0167-9260(96)00005-3openalex-snapshot
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy
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/b978-0-444-88790-0.50009-5openalex-snapshot
Mapping Algorithms onto VLSI Architectures
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/s0304-3975(97)00238-7openalex-snapshot
Testing and reconfiguration of VLSI linear arrays
inferred← citeshttps://doi.org/10.1109/12.214686openalex-snapshot
A polynomial time algorithm for reconfiguring multiple-track models
inferred← citeshttps://doi.org/10.1109/12.237725openalex-snapshot
Reconfigurability and reliability of systolic/wavefront arrays
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.247834openalex-snapshot
Reconfiguring processor arrays using multiple-track models: the 3-track-1-spare-approach
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.862214openalex-snapshot
Fault-tolerant processor arrays based on the 1 1/2 -track switches with flexible spare distributions
inferred← citeshttps://doi.org/10.1109/40.272839openalex-snapshot
Reconfiguring fault-tolerant two-dimensional array architectures
inferred← citeshttps://doi.org/10.1109/92.661257openalex-snapshot
A dynamically reconfigurable interconnect for array processors
inferred← citeshttps://doi.org/10.1109/acssc.1990.523458openalex-snapshot
A New Reconfiguration Algorithm For Designing Fault-Tolerant Hexagonal Arrays
inferred← citeshttps://doi.org/10.1109/asap.1990.145478openalex-snapshot
Fault-tolerant array processors using N-and-half-track switches
inferred← citeshttps://doi.org/10.1109/aspdac.2008.4483950openalex-snapshot
Ordered escape routing based on Boolean satisfiability
inferred← citeshttps://doi.org/10.1109/aspdac.2009.4796545openalex-snapshot
On using SAT to ordered escape problems
inferred← citeshttps://doi.org/10.1109/ats.1994.367205openalex-snapshot
Switching networks and neural algorithms for reconstructing mesh-connected processor arrays with spares on their sides
inferred← citeshttps://doi.org/10.1109/dftvs.1993.595639openalex-snapshot
On the configuration of degradable VLSI/WSI arrays
inferred← citeshttps://doi.org/10.1109/dftvs.1994.630030openalex-snapshot
Reconfiguration in 3D meshes
inferred← citeshttps://doi.org/10.1109/dftvs.1995.476943openalex-snapshot
Reconfigurable architectures for mesh-arrays with PE and link faults
inferred← citeshttps://doi.org/10.1109/dftvs.1996.572041openalex-snapshot
Reconfiguration of 1 1/2 track-switch mesh-arrays with PE and bus faults
inferred← citeshttps://doi.org/10.1109/dftvs.1997.628328openalex-snapshot
Self-reconstruction of mesh-arrays with 1 1/2 -track switches by digital neural circuits
inferred← citeshttps://doi.org/10.1109/dftvs.2000.887159openalex-snapshot
Built-in self-reconfiguring systems for mesh-connected processor arrays with spares on two rows/columns
inferred← citeshttps://doi.org/10.1109/dftvs.2000.887162openalex-snapshot
Self-reconfigurable mesh array system on FPGA
inferred← citeshttps://doi.org/10.1109/ftcs.1991.146700openalex-snapshot
Reconfiguration algorithm for fault-tolerant arrays with minimum number of dangerous processors
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.1999.781042openalex-snapshot
Efficient network-flow based techniques for dynamic fault reconfiguration in FPGAs
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323718openalex-snapshot
NeuroEscape: Ordered Escape Routing via Monte-Carlo Tree Search and Neural Network
inferred← citeshttps://doi.org/10.1109/icci.1992.227700openalex-snapshot
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays with bidirectional links
inferred← citeshttps://doi.org/10.1109/icwsi.1990.63905openalex-snapshot
Some new algorithms for reconfiguring VLSI/WSI arrays
inferred← citeshttps://doi.org/10.1109/icwsi.1991.151711openalex-snapshot
VHDL-based design and analysis of defect tolerant VLSI/WSI array architectures
inferred← citeshttps://doi.org/10.1109/icwsi.1991.151732openalex-snapshot
Reconfiguring processor arrays using multiple-track models
inferred← citeshttps://doi.org/10.1109/icwsi.1995.515443openalex-snapshot
A neural algorithm for reconstructing mesh-connected processor arrays using single-track switches
inferred← citeshttps://doi.org/10.1109/iscas.1991.176687openalex-snapshot
Space-efficient implementation of binary-tree architectures in arrays containing faulty processing elements
inferred← citeshttps://doi.org/10.1109/iscas.2013.6572368openalex-snapshot
Preprocessing technique for accelerating reconfiguration of degradable VLSI arrays
inferred← citeshttps://doi.org/10.1109/ispan.1996.508985openalex-snapshot
Efficient reconfiguration scheme for mesh-connected network: the recursive shift approach
inferred← citeshttps://doi.org/10.1109/ispan.1997.645047openalex-snapshot
A polynomial time algorithm for reconfiguring the 1 1/2 track-switch model with PE and bus faults
inferred← citeshttps://doi.org/10.1109/ispan.1997.645137openalex-snapshot
A built-in self-reconfigurable scheme for 3D mesh arrays
inferred← citeshttps://doi.org/10.1109/ispan.2000.900260openalex-snapshot
A system for efficiently self-reconstructing E-1 1/2 track switch torus arrays
inferred← citeshttps://doi.org/10.1109/prdc.1999.816235openalex-snapshot
A new placement algorithm dedicated to parallel computers: bases and application
inferred← citeshttps://doi.org/10.1109/prdc.2001.992703openalex-snapshot
Analytical results for reconfiguration of E-1 1/2 -track switch torus arrays with multiple fault types
inferred← citeshttps://doi.org/10.1109/prdc.2012.11openalex-snapshot
A Built-in Circuit for Self-Repairing Mesh-Connected Processor Arrays by Direct Spare Replacement
inferred← citeshttps://doi.org/10.1109/prdc.2017.24openalex-snapshot
A Built-in Circuit for Self-Repairing Mesh-Connected Processor Arrays with Spares on Diagonal
inferred← citeshttps://doi.org/10.1109/prdc.2018.00011openalex-snapshot
Degradable Restructuring of Mesh-Connected Processor Arrays with Spares on Orthogonal Sides
inferred← citeshttps://doi.org/10.1109/prdc.2018.00029openalex-snapshot
Restructuring Mesh-Connected Processor Arrays with Spares on Four Sides by Orthogonal Side Rotation
inferred← citeshttps://doi.org/10.1109/secon.1993.465764openalex-snapshot
A distributed 2-fault tolerant control algorithm for reconfiguring fault-tolerant mesh arrays
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/tim.2003.822717openalex-snapshot
A Self-Reconfigurable Hardware Architecture for Mesh Arrays Using Single/Double Vertical Track Switches
inferred← citeshttps://doi.org/10.1137/s0097539794274994openalex-snapshot
Fault-Tolerant Meshes with Small Degree
inferred← citeshttps://doi.org/10.1142/s0218126619501111openalex-snapshot
Algorithms for Reconfiguring NoC-Based Fault-Tolerant Multiprocessor Arrays
inferred← citeshttps://doi.org/10.1145/165231.165232openalex-snapshot
Fault-tolerant meshes with small degree
inferred← citeshttps://doi.org/10.1145/262839.263082openalex-snapshot
Efficient breakout routing in printed circuit boards
inferred← citeshttps://doi.org/10.21236/ada226203openalex-snapshot
Algorithms and Architectures for High Speed Signal Processing
inferred← citeshttps://doi.org/10.21236/ada293120openalex-snapshot
Systematic Methods for Design of VLSI Signal Processing Arrays for Communications Applications.
inferred← citeshttps://doi.org/10.5555/127787.127867openalex-snapshot
A fast algorithm for connecting grid points to the boundary with nonintersecting straight lines
inferred← citeshttps://doi.org/10.5555/1356802.1356865openalex-snapshot
Ordered escape routing based on Boolean satisfiability
inferred← citeshttps://doi.org/10.5555/1509633.1509771openalex-snapshot
On using SAT to ordered escape problems
inferred← citeshttps://doi.org/10.5555/338219.338632openalex-snapshot
Escaping a grid by edge-disjoint paths
inferred← citeshttps://doi.org/10.7301/z0hd7t0fopenalex-snapshot
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs
showing the first 82 of 83 · page through all 83
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.