Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Lower bounds on systolic gossip
Information and Computation
Faster gossiping on butterfly networks
Theoretical Computer Science - Automata, languages and programming
Edge-disjoint spanning trees for the generalized butterfly networks and their applications
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
On the k-tuple domination of de Bruijn and Kautz digraphs
Information Processing Letters
Lower bounds on systolic gossip
Information and Computation
Hi-index | 0.00 |