On the public citation graph
Sorting networks: To the end and back again
0 signed · 56 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/3-540-59496-5_303openalex-snapshot
Incremental co-evolution of organisms: A new approach for optimization and discovery of strategies
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_12openalex-snapshot
Toward a Lower Bound for Sorting Networks
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-642-02777-2_18openalex-snapshot
Cardinality Networks and Their Applications
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_10openalex-snapshot
Pairwise Cardinality 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.1007/s10601-010-9105-0openalex-snapshot
Cardinality Networks: a theoretical and empirical study
inferredcites →https://doi.org/10.1016/0012-365x(74)90080-6openalex-snapshot
Sorting by means of swappings
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.09.004openalex-snapshot
Optimal-depth sorting networks
inferredcites →https://doi.org/10.1109/82.251840openalex-snapshot
Sorting network based architectures for median filters
inferredcites →https://doi.org/10.1109/92.335027openalex-snapshot
Novel sorting network-based architectures for rank order filters
inferredcites →https://doi.org/10.1109/acssc.1997.680275openalex-snapshot
Evolving sorting networks using genetic programming and the rapidly reconfigurable Xilinx 6216 field-programmable gate array
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.1109/tai.2003.1250177openalex-snapshot
Probing-based preprocessing techniques for propositional satisfiability
inferredcites →https://doi.org/10.1142/s0129626492000337openalex-snapshot
THE PAIRWISE SORTING NETWORK
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/2330163.2330248openalex-snapshot
Efficient filters for the simulated evolution of small sorting networks
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.5555/2567709.2502591openalex-snapshot
Using symmetry and evolutionary search to minimize sorting networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.3142openalex-snapshot
Vectorized and performance‐portable quicksort
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-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/s10601-026-09396-3openalex-snapshot
Commentary on “Cardinality Networks: a theoretical and empirical study”
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.09.004openalex-snapshot
Optimal-depth sorting networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.05.002openalex-snapshot
Special issue: Selected papers of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015
inferred← citeshttps://doi.org/10.1038/s41534-018-0071-5openalex-snapshot
Improved techniques for preparing eigenstates of fermionic Hamiltonians
inferred← citeshttps://doi.org/10.1109/access.2020.3047594openalex-snapshot
Design, Implementation, and Analysis of High-Speed Single-Stage N-Sorters and N-Filters
inferred← citeshttps://doi.org/10.1109/access.2022.3194538openalex-snapshot
Use of Carry Chain Logic and Design System Extensions to Construct Significantly Faster and Larger Single-Stage N-Sorters and N-Filters
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/tevc.2019.2918212openalex-snapshot
Evolutionary Development of Growing Generic Sorting Networks by Means of Rewriting Systems
inferred← citeshttps://doi.org/10.1109/tevc.2023.3296780openalex-snapshot
Quantum Genetic Algorithm With Individuals in Multiple Registers
inferred← citeshttps://doi.org/10.1109/tnano.2021.3113731openalex-snapshot
Four Input Sorter Good, Larger Ones Not So Good
inferred← citeshttps://doi.org/10.1109/vlsi-soc.2019.8920322openalex-snapshot
Hardware Considerations for Selection Networks
inferred← citeshttps://doi.org/10.11591/ijeecs.v27.i1.pp118-130openalex-snapshot
Field programmable gate arrays implementation of different standard deviation estimation techniques
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.24246/ijiteb.112018.10-15openalex-snapshot
Parallel Counting Sort: A Modified of Counting Sort Algorithm
inferred← citeshttps://doi.org/10.25949/19431368openalex-snapshot
Quantum algorithmic techniques for fault-tolerant quantum computers
inferred← citeshttps://doi.org/10.29007/lzksopenalex-snapshot
Minimizing Sorting Networks at the Sub-Comparator Level
inferred← citeshttps://doi.org/10.32628/ijsrst16122271openalex-snapshot
Real-Time Fraud Detection Using AI on financial streaming Data
inferred← citeshttps://doi.org/10.4230/oasics.dx.2024.6openalex-snapshot
Challenges for Model-Based Diagnosis
inferred← citeshttps://doi.org/10.48550/arxiv.1806.00305openalex-snapshot
Joint Size and Depth Optimization of Sorting Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1807.05377openalex-snapshot
SAT encodings for sorting networks, single-exception sorting networks and $ε-$halvers
inferred← citeshttps://doi.org/10.48550/arxiv.2012.04400openalex-snapshot
An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels
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.