On the public citation graph

Optimal sorting on multi-dimensionally mesh-connected computers

0 signed · 52 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-16766-8_8openalex-snapshot

Lower bounds for sorting on mesh-connected architectures

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.1016/0010-4485(85)90134-4openalex-snapshot

Computational aspects of VLSI

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

inferredcites →https://doi.org/10.1145/800053.801938openalex-snapshot

Design of special-purpose VLSI chips

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.1006/jpdc.1994.1018openalex-snapshot

On Multidimensional Packet Routing for Meshes with Buses

inferred← citeshttps://doi.org/10.1007/3-540-16766-8_8openalex-snapshot

Lower bounds for sorting on mesh-connected architectures

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_20openalex-snapshot

Packet routing on grids of processors

inferred← citeshttps://doi.org/10.1007/3-540-63890-3_5openalex-snapshot

Playing tetris on meshes and multi-dimensional Shearsort

inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_11openalex-snapshot

Randomized Parallel Computation

inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_6openalex-snapshot

Sorting Networks on Restricted Topologies

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/bf00264359openalex-snapshot

Lower bounds for sorting on mesh-connected architectures

inferred← citeshttps://doi.org/10.1007/bf01185337openalex-snapshot

Packet routing on grids of processors

inferred← citeshttps://doi.org/10.1007/bf01758834openalex-snapshot

Optimal routing algorithms for mesh-connected processor arrays

inferred← citeshttps://doi.org/10.1007/bf01762132openalex-snapshot

Sorting in constant number of row and column phases on a mesh

inferred← citeshttps://doi.org/10.1007/bfb0020819openalex-snapshot

Constant queue routing on a mesh

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/s004930170007openalex-snapshot

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols

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(91)90193-lopenalex-snapshot

A unified algorithm for sorting on multidimensional mesh-connected 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/0167-8191(90)90133-topenalex-snapshot

Systolic algorithm for tensor products of matrices: Implementation and applications

inferred← citeshttps://doi.org/10.1016/0743-7315(91)90120-xopenalex-snapshot

(k−k) Routing on multidimensional mesh-connected arrays

inferred← citeshttps://doi.org/10.1016/0743-7315(92)90108-yopenalex-snapshot

Constant queue routing on a mesh

inferred← citeshttps://doi.org/10.1016/b978-1-4832-0772-8.50008-xopenalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00138-2openalex-snapshot

Multiplicative circulant networks topological properties and communication algorithms

inferred← citeshttps://doi.org/10.1023/a:1019146428683openalex-snapshot

Efficient sorting on the star graph interconnection network

inferred← citeshttps://doi.org/10.1109/12.628397openalex-snapshot

An efficient sorting algorithm on the multi-mesh network

inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot

Parallel techniques for computational geometry

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/71.372798openalex-snapshot

Two packet routing algorithms on a mesh-connected computer

inferred← citeshttps://doi.org/10.1109/sfcs.1996.548496openalex-snapshot

Deterministic routing with bounded buffers: turning offline into online protocols

inferred← citeshttps://doi.org/10.1109/spdp.1991.218234openalex-snapshot

Packet routing on square meshes with row and column buses

inferred← citeshttps://doi.org/10.1137/s0895480191198604openalex-snapshot

Sorting on a Mesh-Connected Computer with Delaying Links

inferred← citeshttps://doi.org/10.1145/113379.113403openalex-snapshot

Balanced routing

inferred← citeshttps://doi.org/10.1145/3694906.3743353openalex-snapshot

Brief Announcement: Fine-Grained Computation in 3-Space: Matrix Multiplication, Paths, and Mazes

inferred← citeshttps://doi.org/10.1145/72935.72971openalex-snapshot

Multi-packet-routing on mesh connected arrays

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.4230/lipics.tqc.2019.3openalex-snapshot

Circuit Transformations for Quantum Architectures

inferred← citeshttps://doi.org/10.48550/arxiv.1612.06473openalex-snapshot

Sorting Networks On Restricted Topologies

inferred← citeshttps://doi.org/10.62056/ay4fbn2hdopenalex-snapshot

Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions

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.