On the public citation graph

The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes

0 signed · 23 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/bf02090393openalex-snapshot
A computer-assisted optimal depth lower bound for nine-input sorting 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/j.jsc.2013.09.003openalex-snapshot
Practical graph isomorphism, II

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-19212-9_19openalex-snapshot
An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-39958-0_14openalex-snapshot
Enhanced Optimization with Composite Objectives and Novelty Pulsation
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-15579-1_52openalex-snapshot
Sorting Networks: The End Game
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_17openalex-snapshot
New Bounds on Optimal Sorting Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_8openalex-snapshot
Applying Sorting Networks to Synthesize Optimized Sorting Libraries
inferred← citeshttps://doi.org/10.1007/s00165-016-0401-3openalex-snapshot
Optimizing sorting algorithms by using sorting networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.014openalex-snapshot
Sorting nine inputs requires twenty-five comparisons
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.1063/5.0305694openalex-snapshot
Area optimized VLSI sorting network for image denoising application
inferred← citeshttps://doi.org/10.1109/ictai.2014.36openalex-snapshot
Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten)
inferred← citeshttps://doi.org/10.1109/nano47656.2020.9183395openalex-snapshot
Employing Sorting Nets for Designing Reliable Computing Nets
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.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.3390/chips5010005openalex-snapshot
Highly Parallel Sorting Network Verification Using FPGAs
inferred← citeshttps://doi.org/10.48550/arxiv.1410.2736openalex-snapshot
Faster Sorting Networks for $17$, $19$ and $20$ Inputs
inferred← citeshttps://doi.org/10.48550/arxiv.1502.05983openalex-snapshot
Sorting Networks: The Final Countdown
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.