Solving fundamental problems on sparse-meshes

DOI10.1007/BFb0054376zbMath1502.68040MaRDI QIDQ5054864

Jop F. Sibeyn

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized multipacket routing and sorting on meshes
• Algorithms for the parallel alternating direction access machine
• A unified framework for off-line permutation routing in parallel networks
• A fast parallel algorithm for routing in permutation networks
• On Edge Coloring Bipartite Graphs
• k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh

This page was built for publication: Solving fundamental problems on sparse-meshes