On the public citation graph

Cubesort: An optimal sorting algorithm for feasible parallel computers

https://doi.org/10.1007/bfb0040412
0 signed · 20 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.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/tc.1978.1674957openalex-snapshot
Optimal Sorting Algorithms for Parallel Computers
inferredcites →https://doi.org/10.1109/tc.1981.6312172openalex-snapshot
Data broadcasting in SIMD computers
inferredcites →https://doi.org/10.1109/tc.1985.5009385openalex-snapshot
Tight Bounds on the Complexity of Parallel Sorting
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/62.322423openalex-snapshot
Complexity Results for Permuting Data and Other Computations on Parallel Processors
inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot
An 0(n log n) sorting network
inferredcites →https://doi.org/10.1145/800070.802209openalex-snapshot
Routing, merging and sorting on parallel models of computation
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01758844openalex-snapshot
On the parallel-decomposability of geometric problems
inferred← citeshttps://doi.org/10.1007/bfb0020818openalex-snapshot
Optimal parallel recognition of bracket languages on hypercubes
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90016-6openalex-snapshot
Cubesort: A parallel algorithm for sorting N data items with S-sorters
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90081-wopenalex-snapshot
Load balancing and routing on the hypercube and related networks
inferred← citeshttps://doi.org/10.1109/71.224210openalex-snapshot
Optimal algorithms on the pipelined hypercube and related networks
inferred← citeshttps://doi.org/10.1109/tencon.1989.177070openalex-snapshot
The TRANSPOSE machine-a global implementation of a parallel graph reducer
inferred← citeshttps://doi.org/10.1145/277651.277671openalex-snapshot
Deadlock-free routing in arbitrary networks via the flattest common supersequence method
inferred← citeshttps://doi.org/10.1145/73833.73845openalex-snapshot
On the parallel decomposability of geometric problems
inferred← citeshttps://doi.org/10.3844/jcssp.2008.66.71openalex-snapshot
Parallel Two-Dimensional Quicksort Algorithm (PTSA)
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.