On the public citation graph

Fault tolerance in a class of sorting networks

0 signed · 33 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/bf00134013openalex-snapshot
Fault-tolerance in balanced sorting networks
inferredcites →https://doi.org/10.1016/c2013-0-10281-4openalex-snapshot
Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1016/s0065-2458(08)60467-2openalex-snapshot
Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1109/12.21149openalex-snapshot
The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
inferredcites →https://doi.org/10.1109/12.214672openalex-snapshot
Concurrent error detection and correction in real-time systolic sorting arrays
inferredcites →https://doi.org/10.1109/12.35835openalex-snapshot
Merging and sorting networks with the topology of the omega network
inferredcites →https://doi.org/10.1109/12.4615openalex-snapshot
A fault-tolerant systolic sorter
inferredcites →https://doi.org/10.1109/fscs.1990.89546openalex-snapshot
Fault tolerant sorting network
inferredcites →https://doi.org/10.1109/ftcs.1990.89398openalex-snapshot
Concurrent error detection and correction in real-time systolic sorting arrays
inferredcites →https://doi.org/10.1109/ftcs.1991.146673openalex-snapshot
A multiple-fault tolerant sorting network
inferredcites →https://doi.org/10.1109/sfcs.1991.185406openalex-snapshot
Highly fault-tolerant sorting circuits
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/tc.1981.1675693openalex-snapshot
Fault-Diagnosis for a Class of Multistage Interconnection Networks
inferredcites →https://doi.org/10.1109/tc.1983.1676178openalex-snapshot
The VLSI Complexity of Sorting
inferredcites →https://doi.org/10.1109/tc.1985.5009383openalex-snapshot
A Robust Sorting Network
inferredcites →https://doi.org/10.1137/0214009openalex-snapshot
On Fault-Tolerant Networks for Sorting
inferredcites →https://doi.org/10.1137/0404042openalex-snapshot
Fault Tolerant Sorting Networks
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/322326.322329openalex-snapshot
Parallel permutation and sorting algorithms and a new generalized connection network
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/800221.806719openalex-snapshot
The balanced sorting network
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-46964-2_7openalex-snapshot
Sorting and Selection Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-0853-3_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4615-0853-3_3openalex-snapshot
Algorithm-Based Fault Tolerance for Combinational Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-53651-0_4openalex-snapshot
Reliability of Two-Terminal Networks Equivalent to Small Optimal Sorting Nets
inferred← citeshttps://doi.org/10.1109/81.508173openalex-snapshot
A novel class of sorting networks
inferred← citeshttps://doi.org/10.1109/nano47656.2020.9183395openalex-snapshot
Employing Sorting Nets for Designing Reliable Computing Nets
inferred← citeshttps://doi.org/10.1109/pacrim.1997.620414openalex-snapshot
Testing and fault tolerance properties in a class of sorting networks
inferred← citeshttps://doi.org/10.1109/pacrim.1999.799500openalex-snapshot
Fault tolerance analysis of odd-even transposition sorting networks
inferred← citeshttps://doi.org/10.1109/pacrim.2003.1235750openalex-snapshot
Fault tolerance analysis of odd-even transposition sorting networks with single pass and multiple passes
inferred← citeshttps://doi.org/10.1109/tnano.2021.3113731openalex-snapshot
Four Input Sorter Good, Larger Ones Not So Good
inferred← citeshttps://doi.org/10.1145/237814.237876openalex-snapshot
An O ( n log n )-size fault-tolerant sorting network (extended abstract)
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.