On the public citation graph
A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
0 signed · 39 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-3-642-95424-5openalex-snapshot
Diagnosis & Reliable Design of Digital Systems
inferredcites →https://doi.org/10.1007/bf01531073openalex-snapshot
The tabu search metaheuristic: How we used it
inferredcites →https://doi.org/10.1007/bf01759033openalex-snapshot
Partitioning circuits for improved testability
inferredcites →https://doi.org/10.1007/bf02085633openalex-snapshot
A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
inferredcites →https://doi.org/10.1007/bf02239976openalex-snapshot
Using tabu search techniques for graph coloring
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0377-2217(89)90185-9openalex-snapshot
New approaches for heuristic search: A bilateral linkage with artificial intelligence
inferredcites →https://doi.org/10.1049/ip-e.1984.0021openalex-snapshot
An algorithm for the partitioning of logic circuits
inferredcites →https://doi.org/10.1109/mdt.1985.294856openalex-snapshot
Built-In Self-Test Techniques
inferredcites →https://doi.org/10.1109/mdt.1985.294857openalex-snapshot
Built-In Self-Test Structures
inferredcites →https://doi.org/10.1109/proc.1977.10762openalex-snapshot
Applied computation theory: Analysis, design, modeling
inferredcites →https://doi.org/10.1109/spdp.1991.218194openalex-snapshot
Test generation in a distributed environment
inferredcites →https://doi.org/10.1109/tc.1981.1675744openalex-snapshot
The Weighted Syndrome Sums Approach to VLSI Testing
inferredcites →https://doi.org/10.1109/tc.1981.6312152openalex-snapshot
LSI logic testing — An overview
inferredcites →https://doi.org/10.1109/tc.1983.1676202openalex-snapshot
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing
inferredcites →https://doi.org/10.1109/tc.1986.1676718openalex-snapshot
Linear Dependencies in Linear Feedback Shift Registers
inferredcites →https://doi.org/10.1109/tc.1986.1676772openalex-snapshot
Condensed Linear Feedback Shift Register (LFSR) Testing—A Pseudoexhaustive Test Technique
inferredcites →https://doi.org/10.1109/test.1988.207864openalex-snapshot
Detecting bridging faults with stuck-at test sets
inferredcites →https://doi.org/10.1145/322077.322090openalex-snapshot
`` Strong '' NP-Completeness Results
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/etep.255openalex-snapshot
A new min‐cut problem with application to electric power network partitioning
inferred← citeshttps://doi.org/10.1007/0-306-48056-5_17openalex-snapshot
Parallel Strategies for Meta-Heuristics
inferred← citeshttps://doi.org/10.1007/0-387-23667-8_13openalex-snapshot
Parallel Computation, Co-operation, Tabu Search
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_702openalex-snapshot
Meta-heuristics for circuit partitioning in parallel test generation
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_13openalex-snapshot
Strategies for the Parallel Implementation of Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-1-4615-4102-8_1openalex-snapshot
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges
inferred← citeshttps://doi.org/10.1007/bfb0018549openalex-snapshot
Cooperative multi-thread parallel tabu search with an application to circuit partitioning
inferred← citeshttps://doi.org/10.1016/0167-9260(95)00008-4openalex-snapshot
Recent directions in netlist partitioning: a survey
inferred← citeshttps://doi.org/10.1016/s0167-739x(98)00045-4openalex-snapshot
Annealing-based heuristics and genetic algorithms for circuit partitioning in parallel test generation
inferred← citeshttps://doi.org/10.1017/cbo9780511529627.011openalex-snapshot
Evolutionary and Adaptive Synthesis Methods
inferred← citeshttps://doi.org/10.1023/a:1009670031749openalex-snapshot
Query Optimization in Distributed Relational Databases
inferred← citeshttps://doi.org/10.1023/a:1016540724870openalex-snapshot
A Taxonomy of Hybrid Metaheuristics
inferred← citeshttps://doi.org/10.1023/a:1020551011615openalex-snapshot
A Mixed Heuristic for Circuit Partitioning
inferred← citeshttps://doi.org/10.1023/a:1021893712145openalex-snapshot
On Using Tabu Search for Design Automation of VLSI Systems
showing the first 15 of 16 · page through all 16
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.