On the public citation graph

Self-checking design in Eastern Europe

0 signed · 31 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/978-3-642-76930-6_16openalex-snapshot
Efficient Encoding/Decoding Circuitry for Systematic Unidirectional Error-Detecting Codes
inferredcites →https://doi.org/10.1007/978-94-009-0487-3openalex-snapshot
Self-Timed Control of Concurrent Processes
inferredcites →https://doi.org/10.1007/bf01075093openalex-snapshot
Check of linear combination circuits
inferredcites →https://doi.org/10.1080/00207219308925825openalex-snapshot
Design of fast self-testing checkers for m-out-of-2m and m-out-of-(2m ± 1) codes
inferredcites →https://doi.org/10.1109/12.48866openalex-snapshot
Design of high-speed and cost-effective self-testing checkers for low-cost arithmetic codes
inferredcites →https://doi.org/10.1109/ats.1993.398819openalex-snapshot
General design principles of self-testing code-disjoint PLAs
inferredcites →https://doi.org/10.1109/ftcs.1990.89382openalex-snapshot
The minimal test set for sorting networks and the use of sorting networks in self-testing checkers for unordered codes
inferredcites →https://doi.org/10.1109/ftcs.1993.627360openalex-snapshot
The risk of data corruption in microprocessor-based systems
inferredcites →https://doi.org/10.1109/mdt.1987.295215openalex-snapshot
Testing And Applications of Inverter-Free PLAs
inferredcites →https://doi.org/10.1109/t-c.1971.223136openalex-snapshot
Soviet Progress in the Design of Fault-Tolerant Digital Machines
inferredcites →https://doi.org/10.1109/tc.1984.1676427openalex-snapshot
Design of Totally Self-Checking Checker for 1-out-of-3 Code
inferredcites →https://doi.org/10.1109/tc.2002.1009156openalex-snapshot
Comments on "Novel totally self-checking Berger checker designs based on generalized Berger code partitioning
inferredcites →https://doi.org/10.1147/rd.353.0367openalex-snapshot
Design and performance of the IBM Enterprise System/9000 Type 9121 Vector Facility

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4757-6069-9_6openalex-snapshot
Design of Self-Testing Checkers for m-out-of-n Codes Using Parallel Counters
inferred← citeshttps://doi.org/10.1007/s10836-005-1139-7openalex-snapshot
A Formal Approach to On-Line Monitoring of Digital VLSI Circuits: Theory, Design and Implementation
inferred← citeshttps://doi.org/10.1016/j.sysarc.2007.09.003openalex-snapshot
Dependable design technique for system-on-chip
inferred← citeshttps://doi.org/10.1023/a:1008273606127openalex-snapshot
Design of Self-Testing Checkers for m-out-of-n Codes Using Parallel Counters
inferred← citeshttps://doi.org/10.1109/date.2003.1253783openalex-snapshot
Non-intrusive concurrent error detection in FSMs through state/output compaction and monitoring via parity trees
inferred← citeshttps://doi.org/10.1109/date.2004.1268910openalex-snapshot
On concurrent error detection with bounded latency in FSMs
inferred← citeshttps://doi.org/10.1109/dftvs.1997.628336openalex-snapshot
Designing networks with error detection properties through the fault-error relation
inferred← citeshttps://doi.org/10.1109/dftvs.2002.1173502openalex-snapshot
Designing self-checking FPGAs through error detection codes
inferred← citeshttps://doi.org/10.1109/dftvs.2003.1250130openalex-snapshot
Low cost convolutional code based concurrent error detection in FSMs
inferred← citeshttps://doi.org/10.1109/dftvs.2003.1250156openalex-snapshot
Fault tolerant design of combinational and sequential logic based on a parity check code
inferred← citeshttps://doi.org/10.1109/icvd.2003.1183132openalex-snapshot
SPaRe: selective partial replication for concurrent fault detection in FSMs
inferred← citeshttps://doi.org/10.1109/olt.2003.1214361openalex-snapshot
On-line error detecting constant delay adder
inferred← citeshttps://doi.org/10.1109/tc.2006.185openalex-snapshot
On the Design of Self-Checking Controllers with Datapath Interactions
inferred← citeshttps://doi.org/10.1109/tim.2003.818733openalex-snapshot
SPaRre: selective partial replication for concurrent fault-detection in FSMs
inferred← citeshttps://doi.org/10.4018/978-1-4666-3886-0.ch035openalex-snapshot
Fault-Tolerant and Fail-Safe Design based on Reconfiguration
inferred← citeshttps://doi.org/10.4018/978-1-60960-212-3.ch008openalex-snapshot
Fault-Tolerant and Fail-Safe Design Based on Reconfiguration
inferred← citeshttps://doi.org/10.5555/789083.1022902openalex-snapshot
Non-Intrusive Concurrent Error Detection in FSMs through State/Output Compaction and Monitoring via Parity Trees
inferred← citeshttps://doi.org/10.5555/968878.968955openalex-snapshot
On concurrent error detection with bounded latency in FSMs
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.