A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (Q1899217): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4002466 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4035691 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sorting on a mesh-connected parallel computer / rank | |||
Normal rank | |||
Revision as of 16:31, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues |
scientific article |
Statements
A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (English)
0 references
18 March 1996
0 references
routing algorithm
0 references
packet-routing problem
0 references
queues
0 references
