On the public citation graph
An easily testable optimal-time VLSI-multiplier
0 signed · 37 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.1109/12.2262openalex-snapshot
Efficient testing of optimal time adders
inferredcites →https://doi.org/10.1109/arith.1983.6158077openalex-snapshot
The design of two easily-testable VLSI array multipliers
inferredcites →https://doi.org/10.1109/focs.1967.33openalex-snapshot
Testing for faults in combinational cellular logic arrays
inferredcites →https://doi.org/10.1109/pgec.1964.263830openalex-snapshot
A Suggestion for a Fast Multiplier
inferredcites →https://doi.org/10.1109/t-c.1973.223651openalex-snapshot
Easily Testable Iterative Systems
inferredcites →https://doi.org/10.1109/tc.1979.1675264openalex-snapshot
Detection of Faults in Programmable Logic Arrays
inferredcites →https://doi.org/10.1109/tc.1981.1675718openalex-snapshot
Design of Testable Structures Defined by Simple Loops
inferredcites →https://doi.org/10.1109/tc.1982.1675879openalex-snapshot
Design for Testability—A Survey
inferredcites →https://doi.org/10.1109/tc.1982.1675982openalex-snapshot
A Regular Layout for Parallel Adders
inferredcites →https://doi.org/10.1109/tec.1960.5219822openalex-snapshot
Conditional-Sum Addition Logic
inferredcites →https://doi.org/10.1145/356914.356916openalex-snapshot
Functional Testing of Semiconductor Random Access Memories
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1184/r1/6608873openalex-snapshot
Recursive implementation of optimal time VLSi integer multipliers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_57openalex-snapshot
On network algebras and recursive equations
inferred← citeshttps://doi.org/10.1007/978-3-642-93464-3_29openalex-snapshot
System-Related Aspects of Testing
inferred← citeshttps://doi.org/10.1007/978-94-009-1063-8_12openalex-snapshot
Modular Testing supported by Block Environment Description
inferred← citeshttps://doi.org/10.1007/bf00993129openalex-snapshot
Efficient sensitization of multi-bit-paths for testing embedded modules in synchronous sequential circuits
inferred← citeshttps://doi.org/10.1007/bfb0016245openalex-snapshot
Efficient testing of optimal time adders
inferred← citeshttps://doi.org/10.1007/bfb0040396openalex-snapshot
Regular structures and testing: RCC-adders
inferred← citeshttps://doi.org/10.1016/0026-2714(90)90699-nopenalex-snapshot
Bibliography of literature on testability
inferred← citeshttps://doi.org/10.1016/0165-6074(85)90027-4openalex-snapshot
Layer assignment by simulated annealing
inferred← citeshttps://doi.org/10.1016/0165-6074(87)90134-7openalex-snapshot
CMOS stuck-open self-test for an optimal-time VLSI-multiplier
inferred← citeshttps://doi.org/10.1016/0167-9260(93)90005-wopenalex-snapshot
A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90161-topenalex-snapshot
Computations over finite monoids and their test complexity
inferred← citeshttps://doi.org/10.1023/a:1021752130394openalex-snapshot
Polynomial Formal Verification of Multipliers
inferred← citeshttps://doi.org/10.1109/12.2262openalex-snapshot
Efficient testing of optimal time adders
inferred← citeshttps://doi.org/10.1109/54.587742openalex-snapshot
The K*BMD: A verification data structure
inferred← citeshttps://doi.org/10.1109/ats.2008.40openalex-snapshot
Level-Testability of Multi-operand Adders
inferred← citeshttps://doi.org/10.1109/edac.1990.136640openalex-snapshot
A graphical system for hierarchical specifications and checkups of VLSI circuits
inferred← citeshttps://doi.org/10.1109/edtc.1996.494118openalex-snapshot
K*BMDs: a new data structure for verification
inferred← citeshttps://doi.org/10.1109/ftcs.1989.105583openalex-snapshot
Computations over finite monoids and their test complexity
inferred← citeshttps://doi.org/10.1109/pacrim.1999.799537openalex-snapshot
Probabilistic IP verification
inferred← citeshttps://doi.org/10.1109/vtest.1997.599468openalex-snapshot
Polynomial formal verification of of multipliers
inferred← citeshttps://doi.org/10.1145/97444.97680openalex-snapshot
Optimal-time multipliers and C-testability
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.2783openalex-snapshot
A C-Testable 4-2 Adder Tree for an Easily Testable High-Speed Multiplier
inferred← citeshttps://doi.org/10.5555/949970.950009openalex-snapshot
A graphical system for hierarchical specifications and checkups of VLSI circuits
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.