TIME-OPTIMAL GEOMETRIC ALGORITHMS IN HYPERCUBIC NETWORKS

DOI10.1080/10637199408915462zbMath1049.68503OpenAlexW2014903290MaRDI QIDQ4820046

Pascal Berthomé, Alfonso Ferreira

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199408915462

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
• A Self-Routing Benes Network and Parallel Permutation Algorithms
• Parallel permutation and sorting algorithms and a new generalized connection network
• PARALLEL SYNERGY

This page was built for publication: TIME-OPTIMAL GEOMETRIC ALGORITHMS IN HYPERCUBIC NETWORKS