Efficient randomized routing algorithms on the two-dimensional mesh of buses

DOI10.1016/S0304-3975(00)00141-9zbMath0972.68085WikidataQ127433711 ScholiaQ127433711MaRDI QIDQ5941436

Eiji Miyano, S. Tajima, Hisao Tamaki, Kazuo Iwama

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

randomized algorithmmesh of busespermutation routing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oblivious routing with limited buffer capacity
• On multidimensional packet routing for meshes with buses
• On a set of almost deterministic k-independent random variables
• Oblivious routing algorithms on the mesh of buses
• A lower bound for permutation routing on two-dimensional bused meshes
• New Bounds for Oblivious Mesh Routing
• Routing Problems on the Mesh of Buses
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Efficient randomized routing algorithms on the two-dimensional mesh of buses