On the public citation graph
Optimal diagnostic methods for wiring interconnects
0 signed · 44 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.1007/978-1-4612-9914-1openalex-snapshot
Combinatorics with Emphasis on the Theory of Graphs
inferredcites →https://doi.org/10.1016/0196-6774(88)90005-3openalex-snapshot
Almost all k-colorable graphs are easy to color
inferredcites →https://doi.org/10.1016/s0019-9958(61)80037-5openalex-snapshot
A note on error detection codes for asymmetric channels
inferredcites →https://doi.org/10.1016/s0019-9958(62)90223-1openalex-snapshot
Optimal error detection codes for completely asymmetric binary channels
inferredcites →https://doi.org/10.1109/sfcs.1975.3openalex-snapshot
An application of graph coloring to printed circuit testing
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1109/t-c.1973.223705openalex-snapshot
Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes
inferredcites →https://doi.org/10.1109/t-c.1974.223950openalex-snapshot
Testing for Faults in Wiring Networks
inferredcites →https://doi.org/10.1109/tc.1977.1674911openalex-snapshot
On Totally Self-Checking Checkers for Separable Codes
inferredcites →https://doi.org/10.1109/tc.1982.1676034openalex-snapshot
Theory of Unidirectional Error Correcting/Detecting Codes
inferredcites →https://doi.org/10.1109/test.1988.207790openalex-snapshot
Testing and diagnosis of interconnects using boundary scan architecture
inferredcites →https://doi.org/10.1109/test.1989.82278openalex-snapshot
A new framework for analyzing test generation and diagnosis algorithms for wiring interconnects
inferredcites →https://doi.org/10.1109/test.1989.82279openalex-snapshot
A unified theory for designing optimal test generation and diagnosis algorithms for board interconnects
inferredcites →https://doi.org/10.1145/321921.321926openalex-snapshot
The Complexity of Near-Optimal Graph Coloring
inferredcites →https://doi.org/10.1145/359094.359101openalex-snapshot
New methods to color the vertices of a graph
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bfb0030827openalex-snapshot
Optimal algorithms for finding connected components of an unknown graph
inferred← citeshttps://doi.org/10.1007/bfb0049405openalex-snapshot
Approximation algorithm on multi-way maxcut partitioning
inferred← citeshttps://doi.org/10.1007/s10878-020-00528-wopenalex-snapshot
Contrast in greyscales of graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100773openalex-snapshot
Minimum gradation in greyscales of graphs
inferred← citeshttps://doi.org/10.1016/s1004-4132(07)60012-7openalex-snapshot
Five modified boundary scan adaptive test generation algorithms
inferred← citeshttps://doi.org/10.1109/12.736440openalex-snapshot
Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
inferred← citeshttps://doi.org/10.1109/92.407000openalex-snapshot
Optimal interconnect diagnosis of wiring networks
inferred← citeshttps://doi.org/10.1109/ats.1993.398802openalex-snapshot
Optimal interconnect diagnosis
inferred← citeshttps://doi.org/10.1109/ccece.2005.1557354openalex-snapshot
Nouveau wrapper P1500 incorporant une structure bist pour le test des IP et des interconnexions d'un SoC
inferred← citeshttps://doi.org/10.1109/cicc.1993.590822openalex-snapshot
Crosstalk-minimum layer assignment
inferred← citeshttps://doi.org/10.1109/ftcs.1997.614089openalex-snapshot
Optimal structural diagnosis of wiring networks
inferred← citeshttps://doi.org/10.1109/mdt.2008.149openalex-snapshot
Verification of Pin-Accurate Port Connections
inferred← citeshttps://doi.org/10.1109/peam.2011.6135016openalex-snapshot
Syndrome confounding validation of modified W-A anti-aliasing algorithm
inferred← citeshttps://doi.org/10.1109/tcad.2006.873899openalex-snapshot
Efficient Interconnect Test Patterns for Crosstalk and Static Faults
inferred← citeshttps://doi.org/10.1109/tcsii.2008.2010168openalex-snapshot
Highly Compact Interconnect Test Patterns for Crosstalk and Static Faults
inferred← citeshttps://doi.org/10.1109/test.1997.639602openalex-snapshot
Testing the enterprise IBM System/390/sup TM/ multi processor
inferred← citeshttps://doi.org/10.1109/test.2002.1041829openalex-snapshot
Improved digital I/O ports enhance testability of interconnections
inferred← citeshttps://doi.org/10.1109/test.2003.1271192openalex-snapshot
A new maximal diagnosis algorithm for bus-structured systems
inferred← citeshttps://doi.org/10.1109/test.2004.1387346openalex-snapshot
Verification on port connections
inferred← citeshttps://doi.org/10.1109/vtest.1997.599450openalex-snapshot
On the fault coverage of interconnect diagnosis
inferred← citeshttps://doi.org/10.1137/s0097539795288118openalex-snapshot
Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs
inferred← citeshttps://doi.org/10.1137/s0895480100371286openalex-snapshot
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs
inferred← citeshttps://doi.org/10.1145/240518.240556openalex-snapshot
A new complete diagnosis patterns for wiring interconnects
inferred← citeshttps://doi.org/10.1145/290833.290848openalex-snapshot
Structural diagnosis of interconnects by coloring
inferred← citeshttps://doi.org/10.5555/244522.244523openalex-snapshot
Logic optimization by output phase assignment in dynamic logic synthesis
inferred← citeshttps://doi.org/10.5555/244522.244956openalex-snapshot
A coloring approach to the structural diagnosis of interconnects
inferred← citeshttps://doi.org/10.70675/dceda6f1zc596z45fez9465zab5986fe4751openalex-snapshot
Les intérets éducatifs de la pédagogie inspirée du carré logique ISU : étude critique de ses fondements philosophiques, de ses applications dans l'enseignement scolaire, et dans l’éducation informelle
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.