On the public citation graph

Lower bounds for sorting on mesh-connected architectures

https://doi.org/10.1007/bf00264359
0 signed · 44 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/3-540-16811-7_187openalex-snapshot
A general approach to sorting on 3-dimensionally mesh-connected arrays
inferredcites →https://doi.org/10.1007/bfb0039623openalex-snapshot
Optimal sorting on multi-dimensionally mesh-connected computers
inferredcites →https://doi.org/10.1109/mc.1980.1653338openalex-snapshot
The Design of Special-Purpose VLSI Chips
inferredcites →https://doi.org/10.1109/tc.1979.1675216openalex-snapshot
Bitonic Sort on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1109/tc.1983.1676217openalex-snapshot
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
inferredcites →https://doi.org/10.1109/tc.1985.1676603openalex-snapshot
Systolic Sorting on a Mesh-Connected Network
inferredcites →https://doi.org/10.1145/12130.12156openalex-snapshot
An optimal sorting algorithm for mesh connected computers
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.2000.1152openalex-snapshot
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1597openalex-snapshot
Oblivious Routing Algorithms on the Mesh of Buses
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_121openalex-snapshot
Bounds for l-selection and related problems on grids of processors
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_18openalex-snapshot
Sorting within distance bound on a mesh-connected processor array
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_20openalex-snapshot
Packet routing on grids of processors
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_12openalex-snapshot
Sorting and selection on arrays with diagonal connections
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_22openalex-snapshot
Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing
inferred← citeshttps://doi.org/10.1007/978-3-030-81652-0_13openalex-snapshot
Low-Gate Quantum Golden Collision Finding
inferred← citeshttps://doi.org/10.1007/bf00288975openalex-snapshot
Time lower bounds for parallel sorting on a mesh-connected processor array
inferred← citeshttps://doi.org/10.1007/bf01185337openalex-snapshot
Packet routing on grids of processors
inferred← citeshttps://doi.org/10.1007/bf01407814openalex-snapshot
A parallel sorting algorithm for a novel model of computation
inferred← citeshttps://doi.org/10.1007/bf01758834openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1007/bfb0040408openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1007/bfb0040409openalex-snapshot
Routing and sorting on mesh-connected arrays
inferred← citeshttps://doi.org/10.1007/bfb0040410openalex-snapshot
Time lower bounds for parallel sorting on a mesh-connected processor array
inferred← citeshttps://doi.org/10.1007/pl00009288openalex-snapshot
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90190-9openalex-snapshot
Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90073-iopenalex-snapshot
Integer sorting on a mesh-connected array of processors
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90228-3openalex-snapshot
Indexing functions and time lower bounds for sorting on a mesh-connected computer
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00149-9openalex-snapshot
A mathematical model for mesh's dynamic behavior
inferred← citeshttps://doi.org/10.1016/b978-1-4832-0772-8.50008-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80055-9openalex-snapshot
Parallel strong orientation on a mesh connected computer
inferred← citeshttps://doi.org/10.1023/a:1019146428683openalex-snapshot
Efficient sorting on the star graph interconnection network
inferred← citeshttps://doi.org/10.1109/12.16500openalex-snapshot
Parallel sorting in two-dimensional VLSI models of computation
inferred← citeshttps://doi.org/10.1109/12.30857openalex-snapshot
Systolic s/sup 2/-way merge sort is optimal
inferred← citeshttps://doi.org/10.1109/71.159046openalex-snapshot
Sorting in mesh connected multiprocessors
inferred← citeshttps://doi.org/10.1109/71.277787openalex-snapshot
Algorithms and average time bounds of sorting on a mesh-connected computer
inferred← citeshttps://doi.org/10.1109/asap.1991.238883openalex-snapshot
Parallel strong orientation on a mesh connected computer
inferred← citeshttps://doi.org/10.1109/icpp.1998.708456openalex-snapshot
Simulating PRAM with a MSIMD model (ASC)
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185363openalex-snapshot
Concentrated regular data streams on grids: sorting and routing near to the bisection bound
inferred← citeshttps://doi.org/10.1109/spdp.1990.143542openalex-snapshot
Integer sorting on a mesh-connected array of processors
inferred← citeshttps://doi.org/10.1109/spdp.1991.218266openalex-snapshot
Duplicating keys to streamline sorting on a mesh-connected computer
inferred← citeshttps://doi.org/10.1145/113379.113403openalex-snapshot
Balanced routing
inferred← citeshttps://doi.org/10.1145/181014.181022openalex-snapshot
Improved bounds for routing and sorting on multi-dimensional meshes
inferred← citeshttps://doi.org/10.5555/314464.314670openalex-snapshot
Derandomizing algorithms for routing and sorting on meshes
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.