On the public citation graph
An analytical approach to the partial scan problem
0 signed · 136 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-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-74135-7_6openalex-snapshot
Produktionstest synchroner Schaltwerke auf der Basis von Pipelinestrukturen
inferredcites →https://doi.org/10.1016/s0019-9958(62)90193-6openalex-snapshot
Loop-free structure of sequential machines
inferredcites →https://doi.org/10.1049/ep.1978.0048openalex-snapshot
Theory and Design of Switching Circuits
inferredcites →https://doi.org/10.1049/ip-g-1.1985.0025openalex-snapshot
Design of Testable Logic Circuits
inferredcites →https://doi.org/10.1109/43.3140openalex-snapshot
SOCRATES: a highly efficient automatic test pattern generation system
inferredcites →https://doi.org/10.1109/54.19131openalex-snapshot
The V compiler: automatic hardware design
inferredcites →https://doi.org/10.1109/esscirc.1985.5468113openalex-snapshot
Design Automation of Random Testable Circuits
inferredcites →https://doi.org/10.1109/ftcs.1988.5293openalex-snapshot
Advanced automatic test pattern generation and redundancy identification techniques
inferredcites →https://doi.org/10.1109/ftcs.1989.105539openalex-snapshot
An economical scan design for sequential logic test generation
inferredcites →https://doi.org/10.1109/ftcs.1989.105552openalex-snapshot
The design of random-testable sequential circuits
inferredcites →https://doi.org/10.1109/ftcs.1989.105553openalex-snapshot
BALLAST: a methodology for partial scan design
inferredcites →https://doi.org/10.1109/mdt.1984.5005689openalex-snapshot
LOCST: A Built-In Self-Test Technique
inferredcites →https://doi.org/10.1109/t-c.1973.223600openalex-snapshot
Enhancing Testability of Large-Scale Integrated Circuits via Test Points and Additional Logic
inferredcites →https://doi.org/10.1109/tc.1976.1674663openalex-snapshot
A Nine-Valued Circuit Model for Test Generation
inferredcites →https://doi.org/10.1109/tc.1981.1675757openalex-snapshot
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
inferredcites →https://doi.org/10.1109/tc.1983.1676174openalex-snapshot
On the Acceleration of Test Generation Algorithms
inferredcites →https://doi.org/10.1109/tcs.1979.1084687openalex-snapshot
Controllability/observability analysis of digital circuits
inferredcites →https://doi.org/10.1109/test.1988.207858openalex-snapshot
An incomplete scan design approach to test generation for sequential machines
inferredcites →https://doi.org/10.1137/0202017openalex-snapshot
Enumeration of the Elementary Circuits of a Directed Graph
inferredcites →https://doi.org/10.1137/0204007openalex-snapshot
Finding All the Elementary Circuits of a Directed Graph
inferredcites →https://doi.org/10.1145/321679.321684openalex-snapshot
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
inferredcites →https://doi.org/10.1145/362814.362819openalex-snapshot
An efficient search algorithm to find the elementary circuits of a graph
inferredcites →https://doi.org/10.1145/37888.37947openalex-snapshot
On computing optimized input probabilities for random tests
inferredcites →https://doi.org/10.1287/mnsc.21.5.591openalex-snapshot
Note—A Computational Survey of Methods for the Set Covering Problem
inferredcites →https://doi.org/10.18419/opus-7949openalex-snapshot
Design automation of random testable circuits
inferredcites →https://doi.org/10.5555/317825.317858openalex-snapshot
PROTEST: A Tool for Probabilistic Testability Analysis
inferredcites →https://doi.org/10.5555/800262.809170openalex-snapshot
A logic design structure for LSI testability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_135openalex-snapshot
Biquadratic assignment problem; Graph coloring; Graph planarization; Greedy randomized adaptive search procedures; Quadratic assignment problem; Quadratic semi-assignment problem; Three-index assignment problemBiquadratic assignment problem; Graph coloring; Graph planarization; Greedy randomized…
inferred← citeshttps://doi.org/10.1007/11533719_87openalex-snapshot
An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_38openalex-snapshot
Approximating minimum feedback sets and multi-cuts in directed graphs
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_33openalex-snapshot
A polyhedral approach to the feedback vertex set problem
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_21openalex-snapshot
Parameterized Algorithms for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_55openalex-snapshot
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-76930-6_12openalex-snapshot
Emulation of Scan Paths in Sequential Circuit Synthesis
inferred← citeshttps://doi.org/10.1007/bf00971962openalex-snapshot
Incorporating testability considerations in high-level synthesis
inferred← citeshttps://doi.org/10.1007/bf00972090openalex-snapshot
Self-test of sequential circuits with deterministic test pattern sequences
inferred← citeshttps://doi.org/10.1007/bf00993311openalex-snapshot
Partial scan and symbolic test at the register-transfer level
inferred← citeshttps://doi.org/10.1007/bf00993313openalex-snapshot
Partial scan flip-flop selection by use of empirical testability
inferred← citeshttps://doi.org/10.1007/bf00993314openalex-snapshot
Testability-based partial scan analysis
inferred← citeshttps://doi.org/10.1007/bf00993316openalex-snapshot
An exact algorithm for selecting partial scan flip-flops
inferred← citeshttps://doi.org/10.1007/pl00009191openalex-snapshot
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00224-017-9777-6openalex-snapshot
Exact Localisations of Feedback Sets
inferred← citeshttps://doi.org/10.1007/s10836-013-5352-5openalex-snapshot
Eliminating the Timing Penalty of Scan
inferred← citeshttps://doi.org/10.1007/s10836-022-06038-3openalex-snapshot
A Complete Design-for-Test Scheme for Reconfigurable Scan Networks
inferred← citeshttps://doi.org/10.1023/a:1008374811502openalex-snapshot
Deterministic BIST with Partial Scan
inferred← citeshttps://doi.org/10.1049/ip-cdt:19982023openalex-snapshot
Partial scan design based on levellised combinational structure
inferred← citeshttps://doi.org/10.1093/comjnl/bxm039openalex-snapshot
Some Parameterized Problems On Digraphs
inferred← citeshttps://doi.org/10.1109/43.108616openalex-snapshot
The pseudoexhaustive test of sequential circuits
inferred← citeshttps://doi.org/10.1109/43.406718openalex-snapshot
Pseudo-exhaustive built-in TPG for sequential circuits
inferred← citeshttps://doi.org/10.1109/43.703833openalex-snapshot
Hardware-optimal test register insertion
inferred← citeshttps://doi.org/10.1109/54.605994openalex-snapshot
Cost-driven ranking of memory elements for partial intrusion
inferred← citeshttps://doi.org/10.1109/asic.1996.552004openalex-snapshot
An alternative view on weighted random pattern testing
inferred← citeshttps://doi.org/10.1109/ats.1994.367220openalex-snapshot
A unified method for assembling global test schedules
inferred← citeshttps://doi.org/10.1109/ats.1998.741613openalex-snapshot
An optimal time expansion model based on combinational ATPG for RT level circuits
inferred← citeshttps://doi.org/10.1109/ats.1999.810747openalex-snapshot
An effective methodology for mixed scan and reset design based on test generation and structure of sequential circuits
inferred← citeshttps://doi.org/10.1109/ats.1999.810750openalex-snapshot
Static and dynamic test sequence compaction methods for acyclic sequential circuits using a time expansion model
inferred← citeshttps://doi.org/10.1109/ats.2001.990252openalex-snapshot
A multiple phase partial scan design method
inferred← citeshttps://doi.org/10.1109/ats.2003.1250783openalex-snapshot
Reducibility of sequential test generation to combinational test generation for several delay fault models
inferred← citeshttps://doi.org/10.1109/ats.2014.27openalex-snapshot
On Covering Structural Defects in NoCs by Functional Tests
inferred← citeshttps://doi.org/10.1109/ats.2015.12openalex-snapshot
A New Scan Flip Flop Design to Eliminate Performance Penalty of Scan
inferred← citeshttps://doi.org/10.1109/cicc.1991.163995openalex-snapshot
Pascant: a partial scan and test generation system
inferred← citeshttps://doi.org/10.1109/date.1999.761167openalex-snapshot
Full scan fault coverage with partial scan
inferred← citeshttps://doi.org/10.1109/etc.1993.246622openalex-snapshot
Modelling delay in symbolic test for data paths with partial scan
inferred← citeshttps://doi.org/10.1109/ets.2005.4openalex-snapshot
Acceleration of Transition Test Generation for Acyclic Sequential Circuits Utilizing Constrained Combinational Stuck-At Test Generation
inferred← citeshttps://doi.org/10.1109/etw.1999.804415openalex-snapshot
Deterministic BIST with partial scan
inferred← citeshttps://doi.org/10.1109/eurdac.1995.527395openalex-snapshot
Partial scan selection for user-specified fault coverage
inferred← citeshttps://doi.org/10.1109/eurdac.1996.558209openalex-snapshot
Efficient random testing with global weights
inferred← citeshttps://doi.org/10.1109/ftcs.1992.243574openalex-snapshot
Incorporating testability considerations in high-level synthesis
inferred← citeshttps://doi.org/10.1109/ftcs.1996.534598openalex-snapshot
Fault diagnosis using state information
inferred← citeshttps://doi.org/10.1109/glsv.1993.224484openalex-snapshot
Clock partitioning for testability
inferred← citeshttps://doi.org/10.1109/glsv.1994.289966openalex-snapshot
Retiming algorithms with application to VLSI testability
inferred← citeshttps://doi.org/10.1109/iccad.1990.129912openalex-snapshot
Partial scan by use of empirical testability
inferred← citeshttps://doi.org/10.1109/iccad.1995.479998openalex-snapshot
Test register insertion with minimum hardware cost
inferred← citeshttps://doi.org/10.1109/iccad.2000.896530openalex-snapshot
Test generation for acyclic sequential circuits with hold registers
inferred← citeshttps://doi.org/10.1109/iccd.1993.393322openalex-snapshot
Pseudoexhaustive BIST for sequential circuits
inferred← citeshttps://doi.org/10.1109/iccd.2002.1106770openalex-snapshot
An extended class of sequential circuits with combinational test generation complexity
inferred← citeshttps://doi.org/10.1109/icvd.1997.568089openalex-snapshot
Sequential circuit testing: from DFT to SFT
inferred← citeshttps://doi.org/10.1109/icvd.1998.646599openalex-snapshot
Peripheral partitioning and tree decomposition for partial scan
inferred← citeshttps://doi.org/10.1109/icvd.2001.902653openalex-snapshot
Combinational test generation for acyclic sequential circuits using a balanced ATPG model
inferred← citeshttps://doi.org/10.1109/iolts.2008.31openalex-snapshot
Integrating Scan Design and Soft Error Correction in Low-Power Applications
inferred← citeshttps://doi.org/10.1109/iolts.2016.7604709openalex-snapshot
A high performance scan flip-flop design for serial and mixed mode scan test
inferred← citeshttps://doi.org/10.1109/iscas.1992.229920openalex-snapshot
Bounding the test sequence length of sequential circuits by the partial scan design
inferred← citeshttps://doi.org/10.1109/tc.2004.1261835openalex-snapshot
Partial scan design based on circuit state information and functional analysis
inferred← citeshttps://doi.org/10.1109/tcad.2005.847894openalex-snapshot
Combinational automatic test pattern generation for acyclic sequential circuits
inferred← citeshttps://doi.org/10.1109/tcad.2012.2218603openalex-snapshot
Scan to Nonscan Conversion via Test Cube Analysis
inferred← citeshttps://doi.org/10.1109/tdmr.2018.2835414openalex-snapshot
A High Performance Scan Flip-Flop Design for Serial and Mixed Mode Scan Test
inferred← citeshttps://doi.org/10.1109/test.1991.519494openalex-snapshot
A COMMON APPROACH TO TEST GENERATION AND HARDWARE VERIFICATION BASED ON TEMPORAL LOGIC
inferred← citeshttps://doi.org/10.1109/test.1992.527837openalex-snapshot
A Graph Theoretic Approach to Partial Scan Design by K-Cycle Elimination
inferred← citeshttps://doi.org/10.1109/test.1993.470597openalex-snapshot
Inhomogeneous cellular automata for weighted random pattern generation
inferred← citeshttps://doi.org/10.1109/test.1993.470662openalex-snapshot
Partial scan at the register-transfer level
inferred← citeshttps://doi.org/10.1109/test.1994.528043openalex-snapshot
Configuring flip-flops to BIST registers
inferred← citeshttps://doi.org/10.1109/test.1995.529867openalex-snapshot
A new method for partial scan design based on propagation and justification requirements of faults
inferred← citeshttps://doi.org/10.1109/test.1996.557079openalex-snapshot
Partial scan design based on state transition modeling
inferred← citeshttps://doi.org/10.1109/test.1996.557088openalex-snapshot
Partial scan flip flop selection for simulation-based sequential ATPGs
inferred← citeshttps://doi.org/10.1109/test.2001.966734openalex-snapshot
Combinational test generation for various classes of acyclic sequential circuits
inferred← citeshttps://doi.org/10.1109/vlsid.2012.95openalex-snapshot
Eliminating Performance Penalty of Scan
inferred← citeshttps://doi.org/10.1109/vlsid.2014.18openalex-snapshot
Efficient SAT-Based Circuit Initialization for Larger Designs
inferred← citeshttps://doi.org/10.1109/vtest.1991.208124openalex-snapshot
Using target faults to achieve a minimized partial scan path
inferred← citeshttps://doi.org/10.1109/vtest.1992.232723openalex-snapshot
Testability properties of acyclic structures and applications to partial scan design
inferred← citeshttps://doi.org/10.1109/vtest.1994.292330openalex-snapshot
Multiple weighted cellular automata
inferred← citeshttps://doi.org/10.1109/vtest.1998.670870openalex-snapshot
Towards simultaneous delay-fault built-in self-test and partial-scan insertion
inferred← citeshttps://doi.org/10.1109/vts.2010.5469607openalex-snapshot
Low-power test planning for arbitrary at-speed delay-test clock schemes
inferred← citeshttps://doi.org/10.1109/vts.2011.5783731openalex-snapshot
Revival of partial scan: Test cube analysis driven conversion of flip-flops
inferred← citeshttps://doi.org/10.1137/19m1305422openalex-snapshot
Maximal Acyclic Subgraphs and Closest Stable Matrices
inferred← citeshttps://doi.org/10.1145/157485.164882openalex-snapshot
A cost-based approach to partial scan
inferred← citeshttps://doi.org/10.1145/196244.196285openalex-snapshot
An exact algorithm for selecting partial scan flip-flops
inferred← citeshttps://doi.org/10.1145/307418.307545openalex-snapshot
Full scan fault coverage with partial scan
inferred← citeshttps://doi.org/10.1155/1999/97179openalex-snapshot
Signature Analysis for Test Responses of Sequential Circuits
inferred← citeshttps://doi.org/10.18419/opus-3476openalex-snapshot
Test planning for low-power built-in self test
inferred← citeshttps://doi.org/10.18419/opus-3585openalex-snapshot
Self-diagnosis in Network-on-Chips
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07612openalex-snapshot
Exact Localisations of Feedback Sets
inferred← citeshttps://doi.org/10.5555/159754.161769openalex-snapshot
Generation of deterministic test patterns by minimal basic test sets
inferred← citeshttps://doi.org/10.5555/198174.198252openalex-snapshot
Test pattern generation hardware motivated by pseudo-exhaustive test techniques
inferred← citeshttps://doi.org/10.5555/198174.198345openalex-snapshot
Testability analysis and improvement from VHDL behavioral specifications
inferred← citeshttps://doi.org/10.5555/224841.224866openalex-snapshot
Test register insertion with minimum hardware cost
inferred← citeshttps://doi.org/10.5555/252471.252513openalex-snapshot
Efficient random testing with global weights
inferred← citeshttps://doi.org/10.5555/602902.602904openalex-snapshot
Physical planning with retiming
inferred← citeshttps://doi.org/10.5555/602902.603025openalex-snapshot
Test generation for acyclic sequential circuits with hold registers
inferred← citeshttps://doi.org/10.5555/951513.951561openalex-snapshot
On the selection of a partial scan path with respect to target faults
inferred← citeshttps://doi.org/10.6688/jise.2000.16.5.2openalex-snapshot
Flip-Flop Selection for Mixed Scan and Reset Design Based on Test Generation and Structure of Sequential Circuits
inferred← citeshttps://doi.org/10.70675/733cbd10z5feaz4101z9064z62ba9a7dac01openalex-snapshot
Algorithmic and structural results on directed cycles in dense digraphs
inferred← citeshttps://doi.org/10.7282/t3h70fxnopenalex-snapshot
Information theoretic and spectral methods of test point, partial-scan and full-scan flip-flop insertion to improve integrated circuit testability
inferred← citeshttps://doi.org/10.7282/t3rx9cggopenalex-snapshot
SPARTAN: a spectral and entropy-based partial-scan and test point insertion algorithm
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.