On the public citation graph

Parallel sorting on cayley graphs

https://doi.org/10.1007/bf01759059
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-44543-4openalex-snapshot
On Maximal Chain Subgraphs and Covers of Bipartite Graphs.
inferredcites →https://doi.org/10.1007/bf01762132openalex-snapshot
Sorting in constant number of row and column phases on a mesh
inferredcites →https://doi.org/10.1007/bf01937486openalex-snapshot
A new algorithm for generation of permutations
inferredcites →https://doi.org/10.1007/bf02126799openalex-snapshot
Ramanujan graphs
inferredcites →https://doi.org/10.1016/0012-365x(79)90068-2openalex-snapshot
Bounds for sorting by prefix reversal
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/proc.1977.10823openalex-snapshot
Combinatorial algorithms
inferredcites →https://doi.org/10.1137/1024041openalex-snapshot
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
inferredcites →https://doi.org/10.1145/12130.12156openalex-snapshot
An optimal sorting algorithm for mesh connected computers
inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot
An 0(n log n) sorting network
inferredcites →https://doi.org/10.1145/800221.806719openalex-snapshot
The balanced sorting network

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.3230230707openalex-snapshot
Cycle prefix digraphs for symmetric interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_68openalex-snapshot
A ranking algorithm for Hamilton paths in shuffle-exchange graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-04303-5_2openalex-snapshot
The Design of Efficient Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_5openalex-snapshot
Cayley graphs and interconnection networks
inferred← citeshttps://doi.org/10.1007/bf02900857openalex-snapshot
New classes of interconnection topology structures and their properties
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00032-9openalex-snapshot
The REFINE multiprocessor — theoretical properties and algorithms
inferred← citeshttps://doi.org/10.1016/0167-9260(94)90021-3openalex-snapshot
On VLSI layouts of the star graph and related networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.019openalex-snapshot
Networks for sorting multitonic sequences
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00281-9openalex-snapshot
Periodic comparator networks
inferred← citeshttps://doi.org/10.1023/a:1019146428683openalex-snapshot
Efficient sorting on the star graph interconnection network
inferred← citeshttps://doi.org/10.1080/03081089108818055openalex-snapshot
A sequential sorting network analogous to the batcher merge
inferred← citeshttps://doi.org/10.1109/pccc.1995.472497openalex-snapshot
A reconfigurable 1-factor hypercubic embedding interconnection network for parallel processing
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.