Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercube

DOI10.1007/S002240000077MaRDI QIDQ1384708zbMATH OpenOpenAlexFDO

Authors Frank K. Hwang, Yi-Ching Yao

Publication date 30 August 1998

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000077

zbMATH Keywords

many-one routing in hypercubesoblivious algorithm

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99) Parallel algorithms in computer science (68W10)

Recommendations

• Tight bounds for oblivious routing in the hypercube
• Some permutation routing algorithms for low-dimensional hypercubes
• Almost optimal permutation routing on hypercubes
• Fast algorithms for bit-serial routing on a hypercube

Cited in

(3)

• Oblivious routing for LC permutations on hypercubes.
• Tight bounds for oblivious routing in the hypercube
• Some permutation routing algorithms for low-dimensional hypercubes

This page was built for publication: Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384708)