Effective systolic algorithms for gossiping in cycles and two-dimensional grids

DOI10.1007/3-540-60249-6_59MaRDI QIDQ5055899

Juraj Hromkovič, Ralf Klasing, Walter Unger, Dana Pardubská, Juraj Waczulík, Hubert Wagener

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60249-6_59

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

Related Items

Lower bounds on systolic gossip