On the public citation graph
On applying the set covering model to reseeding
0 signed · 29 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.1002/j.1538-7305.1956.tb03835.xopenalex-snapshot
Minimization of Boolean Functions*
inferredcites →https://doi.org/10.1007/978-1-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1109/12.536236openalex-snapshot
Arithmetic additive generators of pseudo-exhaustive test patterns
inferredcites →https://doi.org/10.1109/43.238040openalex-snapshot
COMPACTEST: a method to generate compact test sets for combinational circuits
inferredcites →https://doi.org/10.1109/date.2000.840286openalex-snapshot
Optimal hardware pattern generation for functional BIST
inferredcites →https://doi.org/10.1109/iccad.1995.479997openalex-snapshot
Pattern generation for a deterministic BIST scheme
inferredcites →https://doi.org/10.1109/iscas.1989.100747openalex-snapshot
Combinational profiles of sequential benchmark circuits
inferredcites →https://doi.org/10.1109/tc.1976.1674537openalex-snapshot
Microprogram Optimization: A Survey
inferredcites →https://doi.org/10.1109/tce.1953.6371932openalex-snapshot
The map method for synthesis of combinational logic circuits
inferredcites →https://doi.org/10.1109/test.1992.527812openalex-snapshot
GENERATION OF VECTOR PATTTERNS THROUGH RESEEDING OF MUETIPLE-POLYNOMIAL LINEAR FEEDBACK SHIFT REGIST
inferredcites →https://doi.org/10.1109/test.1998.743181openalex-snapshot
Accumulator based deterministic BIST
inferredcites →https://doi.org/10.1109/test.2000.894259openalex-snapshot
Non-intrusive BIST for systems-on-a-chip
inferredcites →https://doi.org/10.1109/vtest.1997.599440openalex-snapshot
Methods to reduce test application time for accumulator-based self-test
inferredcites →https://doi.org/10.5860/choice.32-0950openalex-snapshot
Synthesis and optimization of digital circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1023/a:1015039323168openalex-snapshot
On-the-Fly Reseeding: A New Reseeding Technique for Test-Per-Clock BIST
inferred← citeshttps://doi.org/10.1109/bec.2014.7320567openalex-snapshot
Comparison of two approaches to improve functional BIST fault coverage
inferred← citeshttps://doi.org/10.1109/dac.2003.1219083openalex-snapshot
Efficient compression and application of deterministic patterns in a logic BIST architecture
inferred← citeshttps://doi.org/10.1109/etw.2003.1231662openalex-snapshot
On the selection of efficient arithmetic additive test pattern generators [logic test]
inferred← citeshttps://doi.org/10.1109/tc.2008.182openalex-snapshot
An Improved Search Method for Accumulator-Based Test Set Embedding
inferred← citeshttps://doi.org/10.1109/tcad.2006.870860openalex-snapshot
On Obtaining Maximum-Length Sequences for Accumulator-Based Serial TPG
inferred← citeshttps://doi.org/10.1109/tcad.2007.906465openalex-snapshot
Minimizing Test Time in Arithmetic Test-Pattern Generators With Constrained Memory Resources
inferred← citeshttps://doi.org/10.1109/test.2005.1584057openalex-snapshot
Efficient compression of deterministic patterns into multiple prpg seeds
inferred← citeshttps://doi.org/10.1109/test.2012.6401558openalex-snapshot
Hybrid selector for high-X scan compression
inferred← citeshttps://doi.org/10.1109/test.2013.6651896openalex-snapshot
Two-level compression through selective reseeding
inferred← citeshttps://doi.org/10.1109/test.2018.8624738openalex-snapshot
XLBIST: X-Tolerant Logic BIST
inferred← citeshttps://doi.org/10.1109/vtest.2004.1299245openalex-snapshot
BIST technique by equally spaced test vector sequences
inferred← citeshttps://doi.org/10.1145/1837274.1837366openalex-snapshot
Fully X-tolerant, very high scan compression
inferred← citeshttps://doi.org/10.1145/2801948.2801969openalex-snapshot
Accumulator-based generation for serial TPG
inferred← citeshttps://doi.org/10.1145/775832.775976openalex-snapshot
Efficient compression and application of deterministic patterns in a logic BIST architecture
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.