k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh

DOI10.1006/JAGM.1995.1042zbMath0836.68018OpenAlexW2079505536MaRDI QIDQ4857537

Sanguthevar Rajasekaran

Publication date: 16 January 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.1042

zbMATH Keywords

sortingrandomized algorithmsrouting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (3)

Solving fundamental problems on sparse-meshes ⋮ Randomized multipacket routing and sorting on meshes ⋮ PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH

This page was built for publication: k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh