On the public citation graph

A Correction Network for N -Sorters

0 signed · 22 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.1109/tc.1985.5009383openalex-snapshot
A Robust Sorting Network
inferredcites →https://doi.org/10.1137/0214009openalex-snapshot
On Fault-Tolerant Networks for Sorting

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1997.1470openalex-snapshot
Breaking theΘ(nlog2n) Barrier for Sorting with Faults
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_62openalex-snapshot
Periodic Correction Networks
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_45openalex-snapshot
Fibonacci Correction Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-4549-1_12openalex-snapshot
Tolerating Faults in Counting Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_24openalex-snapshot
Lower Bounds on Correction Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_14openalex-snapshot
Fast Periodic Correction Networks
inferred← citeshttps://doi.org/10.1007/bfb0040411openalex-snapshot
A correction network for N-sorters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.019openalex-snapshot
Networks for sorting multitonic sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.031openalex-snapshot
Fast periodic correction networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.006openalex-snapshot
Bitonic sorters of minimal depth
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.038openalex-snapshot
Faster merging networks with a small constant period
inferred← citeshttps://doi.org/10.1109/fscs.1990.89546openalex-snapshot
Fault tolerant sorting network
inferred← citeshttps://doi.org/10.1109/icpp.1999.797386openalex-snapshot
Correction networks
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366814openalex-snapshot
Breaking the Θ(nlog/sup 2/ n) barrier for sorting with faults
inferred← citeshttps://doi.org/10.1137/s0097539796305298openalex-snapshot
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
inferred← citeshttps://doi.org/10.1137/s0097539799354308openalex-snapshot
Depth Optimal Sorting Networks Resistant to k Passive Faults
inferred← citeshttps://doi.org/10.1145/165231.165235openalex-snapshot
Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults
inferred← citeshttps://doi.org/10.1145/237814.237876openalex-snapshot
An O ( n log n )-size fault-tolerant sorting network (extended abstract)
inferred← citeshttps://doi.org/10.1145/378580.378697openalex-snapshot
Periodic, random-fault-tolerant correction networks
inferred← citeshttps://doi.org/10.5555/313852.314070openalex-snapshot
Depth optimal sorting networks resistant to k passive faults
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.