On the public citation graph

Efficient testing of optimal time adders

0 signed · 42 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00292108openalex-snapshot
An easily testable optimal-time VLSI-multiplier
inferredcites →https://doi.org/10.1016/0165-6074(87)90134-7openalex-snapshot
CMOS stuck-open self-test for an optimal-time VLSI-multiplier
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/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.1675982openalex-snapshot
A Regular Layout for Parallel Adders
inferredcites →https://doi.org/10.1109/tcs.1981.1084933openalex-snapshot
A hardware approach to self-testing of large programmable logic arrays
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.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/bf00292108openalex-snapshot
An easily testable optimal-time VLSI-multiplier
inferred← citeshttps://doi.org/10.1007/bfb0035828openalex-snapshot
On the construction of optimal time adders
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/0304-3975(91)90161-topenalex-snapshot
Computations over finite monoids and their test complexity
inferred← citeshttps://doi.org/10.1016/j.microrel.2014.12.011openalex-snapshot
Real-time fault-tolerance with hot-standby topology for conditional sum adder
inferred← citeshttps://doi.org/10.1080/1065514021000012255openalex-snapshot
Timing‐Driven‐Testable Convergent Tree Adders
inferred← citeshttps://doi.org/10.1109/12.536237openalex-snapshot
Testability of convergent tree circuits
inferred← citeshttps://doi.org/10.1109/43.406707openalex-snapshot
On the generation of area-time optimal testable adders
inferred← citeshttps://doi.org/10.1109/92.831442openalex-snapshot
On the design of fast, easily testable ALU's
inferred← citeshttps://doi.org/10.1109/arith.1991.145535openalex-snapshot
Exact accumulation of floating-point numbers
inferred← citeshttps://doi.org/10.1109/asic.1998.722982openalex-snapshot
Timing optimization for testable convergent tree adders
inferred← citeshttps://doi.org/10.1109/ats.1997.643907openalex-snapshot
On the adders with minimum tests
inferred← citeshttps://doi.org/10.1109/ats.2004.40openalex-snapshot
Efficient Test Methodologies for Conditional Sum Adders
inferred← citeshttps://doi.org/10.1109/dft.2007.32openalex-snapshot
On-Line Periodic Self-Testing of High-Speed Floating-Point Units in Microprocessors
inferred← citeshttps://doi.org/10.1109/euasic.1991.212854openalex-snapshot
On the construction of very large integer multipliers
inferred← citeshttps://doi.org/10.1109/eurdac.1992.246216openalex-snapshot
A time optimal robust path-delay-fault self-testable adder
inferred← citeshttps://doi.org/10.1109/eurdac.1992.246217openalex-snapshot
A performance driven generator for efficient testable conditional-sum-adders
inferred← citeshttps://doi.org/10.1109/ftcs.1989.105583openalex-snapshot
Computations over finite monoids and their test complexity
inferred← citeshttps://doi.org/10.1109/ftcs.1993.627338openalex-snapshot
Balance testing of logic circuits
inferred← citeshttps://doi.org/10.1109/glsv.1998.665282openalex-snapshot
Mutually disjoint signals and probability calculation in digital circuits
inferred← citeshttps://doi.org/10.1109/mwscas.1990.140848openalex-snapshot
Synchronous versus asynchronous adders
inferred← citeshttps://doi.org/10.1109/secon.1998.673378openalex-snapshot
A novel fault-model for regular and irregular parallel-prefix adders
inferred← citeshttps://doi.org/10.1109/tc.2006.187openalex-snapshot
Testability Analysis and Scalable Test Generation for High-Speed Floating-Point Units
inferred← citeshttps://doi.org/10.1109/vtest.1996.510829openalex-snapshot
Design of a fast, easily testable ALU
inferred← citeshttps://doi.org/10.1155/1994/74269openalex-snapshot
Optimal Testing and Design of Adders
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.1587/transinf.e95.d.1084openalex-snapshot
A C-Testable Multiple-Block Carry Select Adder
inferred← citeshttps://doi.org/10.18926/15505openalex-snapshot
Functional Testing of an ALU
inferred← citeshttps://doi.org/10.5555/159754.161778openalex-snapshot
A performance driven generator for efficient testable conditional-sum-adders
inferred← citeshttps://doi.org/10.5555/159754.161779openalex-snapshot
A time optimal robust path-delay-fault self-testable adder
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.