On the public citation graph

Merging and sorting networks with the topology of the omega network

0 signed · 30 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/t-c.1975.224157openalex-snapshot
Access and Alignment of Data in an Array Processor
inferredcites →https://doi.org/10.1109/tc.1977.1674863openalex-snapshot
The Indirect Binary n-Cube Microprocessor Array
inferredcites →https://doi.org/10.1109/tc.1981.1675790openalex-snapshot
The Universality of the Shuffle-Exchange Network
inferredcites →https://doi.org/10.1109/tc.1983.1676255openalex-snapshot
Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network
inferredcites →https://doi.org/10.1109/tc.1985.5009383openalex-snapshot
A Robust Sorting Network
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/800070.802204openalex-snapshot
Notes on merging networks (Prelimiary Version)
inferredcites →https://doi.org/10.1145/800221.806719openalex-snapshot
The balanced sorting network
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.10003openalex-snapshot
Area efficient layouts of the Batcher sorting networks
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1485openalex-snapshot
The New Class of g-Chain Periodic Sorters
inferred← citeshttps://doi.org/10.1007/978-1-4471-3182-3_5openalex-snapshot
Sorts of butterflies
inferred← citeshttps://doi.org/10.1007/bfb0009510openalex-snapshot
Periodic merging networks
inferred← citeshttps://doi.org/10.1007/bfb0028577openalex-snapshot
On Batcher's merge sorts as parallel sorting algorithms
inferred← citeshttps://doi.org/10.1049/ip-cdt:19981903openalex-snapshot
Embedding meshes and TORUS networks onto degree-four chordal rings
inferred← citeshttps://doi.org/10.1109/12.293261openalex-snapshot
Fault tolerance in a class of sorting networks
inferred← citeshttps://doi.org/10.1109/12.559812openalex-snapshot
Topologies of combined (2 log N-1)-stage interconnection networks
inferred← citeshttps://doi.org/10.1109/4.84937openalex-snapshot
Defect-tolerant hierarchical sorting networks for wafer-scale integration
inferred← citeshttps://doi.org/10.1109/92.238413openalex-snapshot
Design and analysis of defect tolerant hierarchical sorting networks
inferred← citeshttps://doi.org/10.1109/hpcc.2009.50openalex-snapshot
Dynamic Communication-Efficient Parallel Sorting on SMPs
inferred← citeshttps://doi.org/10.1109/icwsi.1990.63893openalex-snapshot
Defect tolerant sorting networks for WSI implementation
inferred← citeshttps://doi.org/10.1109/icwsi.1992.171816openalex-snapshot
Design and analysis of defect tolerant hierarchical sorting networks
inferred← citeshttps://doi.org/10.1109/ipps.1994.288267openalex-snapshot
The generalized class of g-chain periodic sorting networks
inferred← citeshttps://doi.org/10.1109/pi.1999.806402openalex-snapshot
A routing algorithm for modified omega+omega interconnection networks
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2312492openalex-snapshot
Implementation of a High-Throughput Modified Merge Sort in MIMO Detection Systems
inferred← citeshttps://doi.org/10.1137/0218014openalex-snapshot
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1145/1502793.1502799openalex-snapshot
Permuting streaming data using RAMs
inferred← citeshttps://doi.org/10.1145/165231.157378openalex-snapshot
The new class of g-chain periodic sorters
inferred← citeshttps://doi.org/10.1145/3181776openalex-snapshot
A Lower Bound Technique for Communication in BSP
inferred← citeshttps://doi.org/10.5555/1487713.1487716openalex-snapshot
Implementing Sorting Networks with Spiking Neural P Systems
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.