On the public citation graph

Randomized multipacket routing and sorting on meshes

https://doi.org/10.1007/bf02523190
0 signed · 48 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.1006/jagm.1995.1042openalex-snapshot
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
inferredcites →https://doi.org/10.1006/jpdc.1995.1127openalex-snapshot
Hot Potato Worm Routing via Store-and-Forward Packet Routing
inferredcites →https://doi.org/10.1007/3-540-55437-8_83openalex-snapshot
Multipacket routing on rings
inferredcites →https://doi.org/10.1007/3-540-55706-7_11openalex-snapshot
Optimal multi-packet routing on the torus
inferredcites →https://doi.org/10.1007/3-540-57273-2_68openalex-snapshot
Randomized routing on meshes with buses
inferredcites →https://doi.org/10.1007/bf01758834openalex-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/0020-0190(90)90214-iopenalex-snapshot
A guided tour of chernoff bounds
inferredcites →https://doi.org/10.1016/0743-7315(90)90083-2openalex-snapshot
Reducing communication costs for sorting on mesh-connected and linearly connected parallel computers
inferredcites →https://doi.org/10.1109/fmpc.1990.89475openalex-snapshot
On bit-serial packet routing for the mesh and the torus
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.1109/sfcs.1992.267795openalex-snapshot
A theory of wormhole routing in parallel computers
inferredcites →https://doi.org/10.1109/spdp.1991.218264openalex-snapshot
Optimal randomized algorithms for multipacket and cut through routing on the mesh
inferredcites →https://doi.org/10.1109/spdp.1992.242721openalex-snapshot
Deterministic routing on circular arrays
inferredcites →https://doi.org/10.1109/spdp.1993.395448openalex-snapshot
Deterministic permutation routing on meshes
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.2004.1304814openalex-snapshot
IEEE Transactions on Computers
inferredcites →https://doi.org/10.1137/0214030openalex-snapshot
Probabilistic Parallel Algorithms for Sorting and Selection
inferredcites →https://doi.org/10.1145/113379.113381openalex-snapshot
Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
inferredcites →https://doi.org/10.1145/113379.113403openalex-snapshot
Balanced routing
inferredcites →https://doi.org/10.1145/12130.12156openalex-snapshot
An optimal sorting algorithm for mesh connected computers
inferredcites →https://doi.org/10.1145/140901.140905openalex-snapshot
Matching the bisection bound for routing and sorting on the mesh
inferredcites →https://doi.org/10.1145/140901.140907openalex-snapshot
Optimal sorting on mesh-connected processor arrays
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/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
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/72935.72971openalex-snapshot
Multi-packet-routing on mesh connected arrays
inferredcites →https://doi.org/10.1145/7531.7532openalex-snapshot
A logarithmic time sort for linear size networks
inferredcites →https://doi.org/10.1145/97444.97448openalex-snapshot
Average case analysis of greedy routing algorithms on arrays
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.20325openalex-snapshot
Optimal permutation routing for low‐dimensional hypercubes
inferred← citeshttps://doi.org/10.1006/jagm.2001.1200openalex-snapshot
Oblivious Gossiping on Tori
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-48224-5_63openalex-snapshot
Online Packet Routing on Linear Arrays and Rings
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/bfb0002762openalex-snapshot
Sample sort on meshes
inferred← citeshttps://doi.org/10.1007/bfb0054376openalex-snapshot
Solving fundamental problems on sparse-meshes
inferred← citeshttps://doi.org/10.1007/pl00009164openalex-snapshot
Routing on Meshes with Buses
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/j.tcs.2007.04.032openalex-snapshot
Optimal gossiping in square 2D meshes
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00321-3openalex-snapshot
Faster deterministic sorting through better sampling
inferred← citeshttps://doi.org/10.1023/a:1019146428683openalex-snapshot
Efficient sorting on the star graph interconnection network
inferred← citeshttps://doi.org/10.1109/71.689439openalex-snapshot
Gossiping on meshes and tori
inferred← citeshttps://doi.org/10.1109/71.995815openalex-snapshot
Fast gossiping in square meshes/tori with bounded-size packets
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.1137/s009753979427011xopenalex-snapshot
Row-Major 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.