On the public citation graph
A 2n?2 step algorithm for routing in ann �n array with constant-size queues
0 signed · 32 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/bf01758834openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferredcites →https://doi.org/10.1007/bfb0040408openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferredcites →https://doi.org/10.1007/bfb0040409openalex-snapshot
Routing and sorting on mesh-connected arrays
inferredcites →https://doi.org/10.1016/0304-3975(94)90163-5openalex-snapshot
Methods for message routing in parallel machines
inferredcites →https://doi.org/10.1016/0743-7315(92)90108-yopenalex-snapshot
Constant queue routing on a mesh
inferredcites →https://doi.org/10.1145/12130.12156openalex-snapshot
An optimal sorting algorithm for mesh connected computers
inferredcites →https://doi.org/10.1145/141914.990672openalex-snapshot
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1145/72935.72970openalex-snapshot
A 2 n -2 step algorithm for routing in an nxn array with constant size queues
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/jagm.2001.1176openalex-snapshot
An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size
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-48481-7_6openalex-snapshot
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_144openalex-snapshot
Faster sorting and routing on grids with diagonals
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/3-540-64359-1_710openalex-snapshot
Randomized routing and PRAM emulation on parallel machines
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_25openalex-snapshot
New Bounds for Oblivious Mesh Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_10openalex-snapshot
Permutation Routing and (ℓ, k)-Routing on Plane Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_12openalex-snapshot
Packet Routing on the Grid
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_23openalex-snapshot
Policies for Periodic Packet Routing
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00455-5openalex-snapshot
Analysis of permutation routing algorithms
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.1997.580986openalex-snapshot
Oblivious routing algorithms on the mesh of buses
inferred← citeshttps://doi.org/10.1109/spdp.1994.346104openalex-snapshot
Routing with locality in partitioned-bus meshes
inferred← citeshttps://doi.org/10.1137/s009753979427011xopenalex-snapshot
Row-Major Sorting on Meshes
inferred← citeshttps://doi.org/10.1142/s0219265909002431openalex-snapshot
(ℓ, k)-ROUTING ON PLANE GRIDS
inferred← citeshttps://doi.org/10.1145/341800.341822openalex-snapshot
A (2.954 + ε)noblivious routing algorithm on 2D meshes
inferred← citeshttps://doi.org/10.48550/arxiv.0803.2759openalex-snapshot
(l,k)-Routing on Plane Grids
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.