On the public citation graph
Routing and sorting on mesh-connected arrays
0 signed · 96 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.
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.
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/3-540-18625-5_53openalex-snapshot
An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks
inferredcites →https://doi.org/10.1007/bf00264359openalex-snapshot
Lower bounds for sorting on mesh-connected architectures
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/sfcs.1986.54openalex-snapshot
The distance bound for sorting on mesh-connected processor arrays is tight
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/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
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.1002/cpe.4330060704openalex-snapshot
Determining update latency bounds in Galactica Net
inferred← citeshttps://doi.org/10.1006/jagm.1994.1030openalex-snapshot
Randomized Routing and Sorting on Fixed-Connection Networks
inferred← citeshttps://doi.org/10.1006/jagm.1996.0030openalex-snapshot
Routing Problems on the Mesh of Buses
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1116openalex-snapshot
A Communication Architecture for a Massively Parallel Message-Passing Multicomputer
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1015openalex-snapshot
Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0027openalex-snapshot
Routing with Locality on Meshes with Buses
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0052openalex-snapshot
Minimal Adaptive Routing on the Mesh with Bounded Queue Size
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
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-54967-6_79openalex-snapshot
Fast deterministic selection on mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1007/3-540-55437-8_83openalex-snapshot
Multipacket routing on rings
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_11openalex-snapshot
Optimal multi-packet routing on the torus
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_68openalex-snapshot
Routing problems on the mesh of buses
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_62openalex-snapshot
Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_145openalex-snapshot
Deterministic 1 -k routing on meshes with applications to worm-hole routing
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_106openalex-snapshot
Shorter queues for permutation routing on meshes
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_710openalex-snapshot
Randomized routing and PRAM emulation on parallel machines
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_5openalex-snapshot
Efficient Randomized Algorithms for Parallel and Distributed Machines
inferred← citeshttps://doi.org/10.1007/bf01185337openalex-snapshot
Packet routing on grids of processors
inferred← citeshttps://doi.org/10.1007/bf01192690openalex-snapshot
Flit-Serial Packet Routing on Meshes and Tori
inferred← citeshttps://doi.org/10.1007/bf01294128openalex-snapshot
A 2n?2 step algorithm for routing in ann �n array with constant-size queues
inferred← citeshttps://doi.org/10.1007/bf01407814openalex-snapshot
A parallel sorting algorithm for a novel model of computation
inferred← citeshttps://doi.org/10.1007/bf01407839openalex-snapshot
Efficient algorithms for parallel sorting on mesh multicomputers
inferred← citeshttps://doi.org/10.1007/bf01758834openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1007/bf01961542openalex-snapshot
Fast deterministic selection on mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1007/bf02090401openalex-snapshot
A unified framework for off-line permutation routing in parallel networks
inferred← citeshttps://doi.org/10.1007/bf02523190openalex-snapshot
Randomized multipacket routing and sorting on meshes
inferred← citeshttps://doi.org/10.1007/bfb0020465openalex-snapshot
Optimal emulation of meshes on meshes of trees
inferred← citeshttps://doi.org/10.1007/bfb0040408openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90019-ropenalex-snapshot
Mesh permutation routing with locality
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90017-yopenalex-snapshot
Oblivious routing with limited buffer capacity
inferred← citeshttps://doi.org/10.1016/0141-9331(93)90056-dopenalex-snapshot
Optimal algorithms for the many-to-one routing problem on two-dimensional meshes
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90163-5openalex-snapshot
Methods for message routing in parallel machines
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/j.jpdc.2016.05.015openalex-snapshot
Matrix transpose on meshes with buses
inferred← citeshttps://doi.org/10.1023/a:1019146428683openalex-snapshot
Efficient sorting on the star graph interconnection network
inferred← citeshttps://doi.org/10.1080/00207160304673openalex-snapshot
Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
inferred← citeshttps://doi.org/10.1109/12.509915openalex-snapshot
An empirical study of off-line permutation packet routing on two-dimensional meshes based on the multistage routing method
inferred← citeshttps://doi.org/10.1109/12.628397openalex-snapshot
An efficient sorting algorithm on the multi-mesh network
inferred← citeshttps://doi.org/10.1109/71.210810openalex-snapshot
An efficient heuristic for permutation packet routing on meshes with low buffer requirements
inferred← citeshttps://doi.org/10.1109/71.372798openalex-snapshot
Two packet routing algorithms on a mesh-connected computer
inferred← citeshttps://doi.org/10.1109/71.737698openalex-snapshot
Basic operations on the OTIS-Mesh optoelectronic computer
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89475openalex-snapshot
On bit-serial packet routing for the mesh and the torus
inferred← citeshttps://doi.org/10.1109/fmpc.1992.234863openalex-snapshot
Routing algorithms on a mesh-connected computer
inferred← citeshttps://doi.org/10.1109/hpdc.1992.246482openalex-snapshot
Determining update latency bounds in Galactica Net
inferred← citeshttps://doi.org/10.1109/icapp.2002.1173544openalex-snapshot
Efficient weighted multiselection in parallel architectures
inferred← citeshttps://doi.org/10.1109/iccchina.2014.7008385openalex-snapshot
SphericalMesh: A novel and flexible network topology for 60GHz-based wireless data centers
inferred← citeshttps://doi.org/10.1109/iccd.1990.130166openalex-snapshot
Fast parallel communication on mesh connected machines with low buffer requirements
inferred← citeshttps://doi.org/10.1109/icpads.2009.16openalex-snapshot
Routing, Broadcasting, Prefix Sums, and Sorting Algorithms on the Arrangement Graph
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040907openalex-snapshot
Computational geometry on the OTIS-Mesh optoelectronic computer
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213148openalex-snapshot
Routing on meshes in optimum time and with really small queues
inferred← citeshttps://doi.org/10.1109/ipps.1991.153762openalex-snapshot
Scalability of parallel sorting on mesh multicomputers
inferred← citeshttps://doi.org/10.1109/ipps.1993.262802openalex-snapshot
Selection, routing, and sorting on the star graph
inferred← citeshttps://doi.org/10.1109/ipps.1999.760511openalex-snapshot
Efficient parallel algorithms for selection and multiselection on mesh-connected computers
inferred← citeshttps://doi.org/10.1109/mppoi.1997.609157openalex-snapshot
BPC permutations on the OTIS-Mesh optoelectronic computer
inferred← citeshttps://doi.org/10.1109/mppoi.1998.682138openalex-snapshot
Basic operations on the OTIS-Mesh optoelectronic computer
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21942openalex-snapshot
Universal packet routing algorithms
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.1991.218234openalex-snapshot
Packet routing on square meshes with row and column buses
inferred← citeshttps://doi.org/10.1109/spdp.1991.218264openalex-snapshot
Optimal randomized algorithms for multipacket and cut through routing on the mesh
inferred← citeshttps://doi.org/10.1109/spdp.1991.218265openalex-snapshot
Off-line routing with small queues on a mesh-connected processor array
inferred← citeshttps://doi.org/10.1109/spdp.1992.242721openalex-snapshot
Deterministic routing on circular arrays
inferred← citeshttps://doi.org/10.1109/spdp.1993.395448openalex-snapshot
Deterministic permutation routing on meshes
inferred← citeshttps://doi.org/10.1109/spdp.1993.395473openalex-snapshot
Zero-one sorting on the mesh
inferred← citeshttps://doi.org/10.1109/spdp.1994.346104openalex-snapshot
Routing with locality in partitioned-bus meshes
inferred← citeshttps://doi.org/10.1109/spdp.1994.346110openalex-snapshot
Towards practical permutation routing on meshes
inferred← citeshttps://doi.org/10.1137/18m1194341openalex-snapshot
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
inferred← citeshttps://doi.org/10.1142/s0129054198000143openalex-snapshot
PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
inferred← citeshttps://doi.org/10.1145/113379.113381openalex-snapshot
Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
inferred← citeshttps://doi.org/10.1145/129712.129721openalex-snapshot
Methods for message routing in parallel machines
inferred← citeshttps://doi.org/10.1145/140901.140904openalex-snapshot
Simple path selection for optimal routing on processor arrays
inferred← citeshttps://doi.org/10.1145/140901.140918openalex-snapshot
Implementations of randomized sorting on large parallel machines
inferred← citeshttps://doi.org/10.1145/181014.181022openalex-snapshot
Improved bounds for routing and sorting on multi-dimensional meshes
inferred← citeshttps://doi.org/10.1145/181014.181451openalex-snapshot
Minimal adaptive routing on the mesh with bounded queue size
inferred← citeshttps://doi.org/10.1145/327164.327281openalex-snapshot
Many-to-one packet routing on the mesh
inferred← citeshttps://doi.org/10.1145/72935.72971openalex-snapshot
Multi-packet-routing on mesh connected arrays
inferred← citeshttps://doi.org/10.1145/97444.97448openalex-snapshot
Average case analysis of greedy routing algorithms on arrays
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.