On the public citation graph
Constant queue routing on a mesh
0 signed · 31 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-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/bf01758834openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferredcites →https://doi.org/10.1007/bfb0039623openalex-snapshot
Optimal sorting on multi-dimensionally mesh-connected computers
inferredcites →https://doi.org/10.1007/bfb0040409openalex-snapshot
Routing and sorting on mesh-connected arrays
inferredcites →https://doi.org/10.1109/sfcs.1984.715909openalex-snapshot
Parallel Communication With Limited Buffers
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/sfcs.1991.185363openalex-snapshot
Concentrated regular data streams on grids: sorting and routing near to the bisection bound
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.1145/72935.72970openalex-snapshot
A 2 n -2 step algorithm for routing in an nxn array with constant size queues
inferredcites →https://doi.org/10.1145/828.1892openalex-snapshot
Efficient Schemes for Parallel Communication
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.1995.1042openalex-snapshot
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
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.1994.1018openalex-snapshot
On Multidimensional Packet Routing for Meshes with Buses
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1064openalex-snapshot
A Randomized Algorithm for Multipacket Routing on the Mesh
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-63890-3_10openalex-snapshot
Competitive source routing on tori and meshes
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_4openalex-snapshot
Randomized Algorithms on the Mesh
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.1016/s0303-2647(99)00048-9openalex-snapshot
Micro flow bio-molecular computation
inferred← citeshttps://doi.org/10.1109/12.509905openalex-snapshot
Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting
inferred← citeshttps://doi.org/10.1109/fmpc.1992.234863openalex-snapshot
Routing algorithms on a mesh-connected computer
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.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.1145/140901.140904openalex-snapshot
Simple path selection for optimal routing on processor arrays
inferred← citeshttps://doi.org/10.1145/140901.140905openalex-snapshot
Matching the bisection bound for routing and sorting on the mesh
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.