On the public citation graph

The minimal test set for multioutput threshold circuits implemented as sorting networks

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.
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.1016/b978-0-7204-2262-7.50020-xopenalex-snapshot
The Bose-Nelson Sorting Problem††The preparation of this report has been supported in part by the National Science Foundation, and in part by the Office of Naval Research.
inferredcites →https://doi.org/10.1049/ip-e.1983.0007openalex-snapshot
Logic design using digital summation threshold-logic gates
inferredcites →https://doi.org/10.1049/piee.1973.0264openalex-snapshot
Digital-summation threshold-logic gates: a new circuit element
inferredcites →https://doi.org/10.1049/piee.1976.0024openalex-snapshot
Application of multioutput threshold-logic gates to digital-network design
inferredcites →https://doi.org/10.1093/comjnl/21.1.73openalex-snapshot
Some improved designs for the digital summation threshold logic (DSTL) gate
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/iccd.1991.139978openalex-snapshot
Design of a self-testing checker for Borden code
inferredcites →https://doi.org/10.1109/t-c.1973.223705openalex-snapshot
Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes
inferredcites →https://doi.org/10.1109/t-c.1974.223787openalex-snapshot
Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic Functions
inferredcites →https://doi.org/10.1109/t-c.1974.223811openalex-snapshot
Note on Self-Checking Checkers
inferredcites →https://doi.org/10.1109/tc.1978.1675138openalex-snapshot
Efficient Design of Self-Checking Checker for any m-Out-of-n Code
inferredcites →https://doi.org/10.1109/tc.1979.1675245openalex-snapshot
The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
inferredcites →https://doi.org/10.1109/tc.1983.1676219openalex-snapshot
A New Design Method for m-Out-of-n TSC Checkers
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.1137/0204022openalex-snapshot
Improved Divide/Sort/Merge Sorting Networks
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/1500175.1500347openalex-snapshot
An economical construction for sorting networks
inferredcites →https://doi.org/10.1145/321119.321126openalex-snapshot
A Sorting Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1049/el:20000226openalex-snapshot
Minimal test set for multi-output threshold circuitsimplemented as bubble sorting networks
inferred← citeshttps://doi.org/10.1109/12.494103openalex-snapshot
Design of self-testing checkers for Borden codes
inferred← citeshttps://doi.org/10.1109/92.311640openalex-snapshot
A fault-tolerant permutation network modulo arithmetic processor
inferred← citeshttps://doi.org/10.1109/async.1998.666505openalex-snapshot
Membership test logic for delay-insensitive codes
inferred← citeshttps://doi.org/10.1109/dftvs.1997.628317openalex-snapshot
Design of encoders and self-testing checkers for some systematic unidirectional error detecting codes
inferred← citeshttps://doi.org/10.1109/dsd.2005.31openalex-snapshot
Delay Testability Properties of Circuits Implementing Threshold and Symmetric Functions
inferred← citeshttps://doi.org/10.1109/iscas.1999.777872openalex-snapshot
νMOS-based sorters for multiplier implementations
inferred← citeshttps://doi.org/10.1109/olt.2001.937835openalex-snapshot
On the design of self-testing checkers for modified Berger codes
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2000671openalex-snapshot
Automatic Test Generation for Combinational Threshold Logic Networks
inferred← citeshttps://doi.org/10.1155/2000/57240openalex-snapshot
νMOS‐based Sorter for Arithmetic Applications
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.