On the public citation graph
The minimal test set for sorting networks and the use of sorting networks in self-testing checkers for unordered codes
0 signed · 43 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.1016/s0019-9958(61)80037-5openalex-snapshot
A note on error detection codes for asymmetric channels
inferredcites →https://doi.org/10.1016/s0019-9958(62)90223-1openalex-snapshot
Optimal error detection codes for completely asymmetric binary channels
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/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.1977.1674911openalex-snapshot
On Totally Self-Checking Checkers for Separable Codes
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.1987.1676949openalex-snapshot
Design of Fast Self-Testing Checkers for a Class of Berger Codes
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
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-48254-7_18openalex-snapshot
Design of Totally Self-Checking Code-Disjoint Synchronous Sequential Circuits
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/bf00134692openalex-snapshot
Modular implementation of efficient self-checking checkers for the Berger code
inferred← citeshttps://doi.org/10.1023/a:1008244815697openalex-snapshot
On-Line Testing for VLSI—A Compendium of Approaches
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.1023/a:1008369203223openalex-snapshot
Intermediacy Prediction for High Speed Berger Code Checkers
inferred← citeshttps://doi.org/10.1109/12.238498openalex-snapshot
Novel totally self-checking Berger code checker designs based on generalized Berger code partitioning
inferred← citeshttps://doi.org/10.1109/12.277288openalex-snapshot
The minimal test set for multioutput threshold circuits implemented as sorting networks
inferred← citeshttps://doi.org/10.1109/12.278479openalex-snapshot
Reliable floating-point arithmetic algorithms for error-coded operands
inferred← citeshttps://doi.org/10.1109/12.403723openalex-snapshot
On TSC checkers for m-out-of-n codes
inferred← citeshttps://doi.org/10.1109/12.494103openalex-snapshot
Design of self-testing checkers for Borden codes
inferred← citeshttps://doi.org/10.1109/12.599902openalex-snapshot
A self-testing nonincreasing order checker
inferred← citeshttps://doi.org/10.1109/12.980010openalex-snapshot
Design method of a class of embedded combinational self-testing checkers for two-rail codes
inferred← citeshttps://doi.org/10.1109/54.485779openalex-snapshot
Self-checking design in Eastern Europe
inferred← citeshttps://doi.org/10.1109/92.609877openalex-snapshot
Design, analysis, and evaluation of concurrent checking sorting networks
inferred← citeshttps://doi.org/10.1109/async.1998.666505openalex-snapshot
Membership test logic for delay-insensitive codes
inferred← citeshttps://doi.org/10.1109/ats.1997.643972openalex-snapshot
Fault diagnosis of odd-even sorting networks
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/dftvs.1997.628318openalex-snapshot
Design of compact and high speed totally self-checking CMOS checkers for m-out-of-n codes
inferred← citeshttps://doi.org/10.1109/ftcs.1996.534617openalex-snapshot
The design of totally self-checking checkers for some classes of Hadamard codes
inferred← citeshttps://doi.org/10.1109/iccd.1991.139978openalex-snapshot
Design of a self-testing checker for Borden code
inferred← citeshttps://doi.org/10.1109/iolts.2010.5560193openalex-snapshot
Design of embedded constant weight code checkers based on averaging operations
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/olt.2003.1214366openalex-snapshot
Designing FPGA based self-testing checkers for m-out-of-n codes
inferred← citeshttps://doi.org/10.1109/vtest.1998.670889openalex-snapshot
Novel single and double output TSC Berger code checkers
inferred← citeshttps://doi.org/10.1109/vtest.1999.766690openalex-snapshot
Programmable embedded self-testing checkers for all-unidirectional error-detecting codes
inferred← citeshttps://doi.org/10.1155/2000/89292openalex-snapshot
Novel Single and Double Output TSC CMOS Checkers for m‐out‐of‐n Codes
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.