On the public citation graph

Optimal-depth sorting networks

0 signed · 48 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-319-04921-2_19openalex-snapshot
Optimal Sorting Networks
inferredcites →https://doi.org/10.1007/978-3-319-20028-6_17openalex-snapshot
New Bounds on Optimal Sorting Networks
inferredcites →https://doi.org/10.1007/978-3-319-27436-2_8openalex-snapshot
Applying Sorting Networks to Synthesize Optimized Sorting Libraries
inferredcites →https://doi.org/10.1007/978-3-319-40970-2_15openalex-snapshot
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
inferredcites →https://doi.org/10.1007/978-3-642-23786-7_47openalex-snapshot
Boolean Equi-propagation for Optimized SAT Encoding
inferredcites →https://doi.org/10.1007/bf02090393openalex-snapshot
A computer-assisted optimal depth lower bound for nine-input sorting networks
inferredcites →https://doi.org/10.1007/s10601-016-9240-3openalex-snapshot
Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking
inferredcites →https://doi.org/10.1016/0012-365x(90)90173-fopenalex-snapshot
Bounds on the size of test sets for sorting and related networks
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
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.1016/j.artint.2015.03.004openalex-snapshot
Computer-aided proof of Erdős discrepancy properties
inferredcites →https://doi.org/10.1016/j.jcss.2015.11.014openalex-snapshot
Sorting nine inputs requires twenty-five comparisons
inferredcites →https://doi.org/10.1016/j.jcss.2016.04.004openalex-snapshot
Sorting networks: To the end and back again
inferredcites →https://doi.org/10.1016/j.jsc.2013.09.003openalex-snapshot
Practical graph isomorphism, II
inferredcites →https://doi.org/10.1017/s1471068412000130openalex-snapshot
Compiling finite domain constraints to SAT withBEE
inferredcites →https://doi.org/10.1090/s0002-9904-1976-14122-5openalex-snapshot
Every planar map is four colorable
inferredcites →https://doi.org/10.1109/ictai.2014.36openalex-snapshot
Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten)
inferredcites →https://doi.org/10.1109/sfcs.1998.743506openalex-snapshot
The minimum equivalent DNF problem and shortest implicants
inferredcites →https://doi.org/10.1109/synasc.2014.55openalex-snapshot
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes
inferredcites →https://doi.org/10.1145/1248377.1248436openalex-snapshot
Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/76263.76280openalex-snapshot
A computer assisted optimal depth lower bound for sorting networks with nine inputs
inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot
An 0(n log n) sorting network
inferredcites →https://doi.org/10.1215/ijm/1256049011openalex-snapshot
Every planar map is four colorable. Part I: Discharging
inferredcites →https://doi.org/10.1215/ijm/1256049012openalex-snapshot
Every planar map is four colorable. Part II: Reducibility
inferredcites →https://doi.org/10.1524/zkri.1981.155.14.269openalex-snapshot
The numbers of polytypes in close-packings and related structures
inferredcites →https://doi.org/10.1524/zkri.1981.155.3-4.269openalex-snapshot
The numbers of polytypes in close-packings and related structures
inferredcites →https://doi.org/10.1613/jair.3809openalex-snapshot
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
inferredcites →https://doi.org/10.2307/2344967openalex-snapshot
A Survey of Combinatorial Theory.

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-030-53651-0_4openalex-snapshot
Reliability of Two-Terminal Networks Equivalent to Small Optimal Sorting Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-61660-5_25openalex-snapshot
Automatic Synthesis of Optimal-Size Concentrators by Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_29openalex-snapshot
CS Unplugged—How Is It Used, and Does It Work?
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.1109/memcod.2018.8556886openalex-snapshot
Optimal Self-Routing Split Modules for Radix-based Interconnection 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/reconfig.2017.8279784openalex-snapshot
Deriving concentrators from binary sorters using half cleaners
inferred← citeshttps://doi.org/10.1109/telfor48224.2019.8971325openalex-snapshot
Improving performance of sorting small arrays on MIPS CPUs using bitonic sort and SIMD instructions
inferred← citeshttps://doi.org/10.1109/tevc.2019.2918212openalex-snapshot
Evolutionary Development of Growing Generic Sorting Networks by Means of Rewriting Systems
inferred← citeshttps://doi.org/10.1142/s0129626418500019openalex-snapshot
The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks
inferred← citeshttps://doi.org/10.1142/s0129626426500179openalex-snapshot
Optimal Parallel Comparison Sorting for Up to 10 Elements on Up to 10 Processors
inferred← citeshttps://doi.org/10.1145/2893184openalex-snapshot
Practical Algorithms for Finding Extremal Sets
inferred← citeshttps://doi.org/10.1145/3427763.3428316openalex-snapshot
Reactive sorting 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.29007/lzksopenalex-snapshot
Minimizing Sorting Networks at the Sub-Comparator Level
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.1810.11262openalex-snapshot
Some comments on the structure of the best known networks sorting 16 elements
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.