Broadcast networks of bounded degree
SIAM Journal on Discrete Mathematics
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
SIAM Journal on Computing
Broadcasting in bounded degree graphs
SIAM Journal on Discrete Mathematics
Fast information sharing in a complete network
Discrete Applied Mathematics
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Broadcasting in butterfly and deBruijn networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Traffic-light scheduling on the grid
Proceedings of the international workshop on Broadcasting and gossiping 1990
Proceedings of the international workshop on Broadcasting and gossiping 1990
Network Communication in Edge-Colored Graphs: Gossiping
IEEE Transactions on Parallel and Distributed Systems
Lower Bounds on Broadcasting Time of de Bruijn Networks
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract)
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
-Systolic Broadcasting in a Wrapped Butterfly Network
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Faster gossiping on butterfly networks
Theoretical Computer Science - Automata, languages and programming
| Hi-index | 0.00 |