On the public citation graph
A computer assisted optimal depth lower bound for sorting networks with nine inputs
0 signed · 21 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.1007/bf02090767openalex-snapshot
Single-exception sorting networks and the computational complexity of optimal sorting network verification
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.1109/tc.1972.5009021openalex-snapshot
An Improved Lower Bound for Sorting Networks
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/360336.360343openalex-snapshot
Efficient generation of the binary reflected gray code and its applications
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-3-319-04921-2_19openalex-snapshot
Optimal Sorting Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_18openalex-snapshot
On the Computational Complexity of Optimal Sorting Network Verification
inferred← citeshttps://doi.org/10.1007/bf02090393openalex-snapshot
A computer-assisted optimal depth lower bound for nine-input sorting networks
inferred← citeshttps://doi.org/10.1007/bf02090767openalex-snapshot
Single-exception sorting networks and the computational complexity of optimal sorting network verification
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.08.005openalex-snapshot
Merging almost sorted sequences yields a 24-sorter
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.04.004openalex-snapshot
Sorting networks: To the end and back again
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.09.004openalex-snapshot
Optimal-depth sorting networks
inferred← citeshttps://doi.org/10.1109/memcod.2018.8556886openalex-snapshot
Optimal Self-Routing Split Modules for Radix-based Interconnection Networks
inferred← citeshttps://doi.org/10.21941/kcss/2017/03openalex-snapshot
SAT and CP - Parallelisation and Applications
inferred← citeshttps://doi.org/10.21941/kcss/2017/3openalex-snapshot
SAT and CP - Parallelisation and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1502.04748openalex-snapshot
The Takeoff Towards Optimal Sorting Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1502.05983openalex-snapshot
Sorting Networks: The Final Countdown
inferred← citeshttps://doi.org/10.48550/arxiv.1806.00305openalex-snapshot
Joint Size and Depth Optimization of Sorting Networks
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.