Citation: J. Hromkovic et al., OPTIMAL-ALGORITHMS FOR BROADCAST AND GOSSIP IN THE EDGE-DISJOINT PATHMODES, Information and computation, 133(1), 1997, pp. 1-33
Citation: M. Dietzfelbinger et al., A COMPARISON OF 2 LOWER-BOUND METHODS FOR COMMUNICATION COMPLEXITY, Theoretical computer science, 168(1), 1996, pp. 39-51
Citation: J. Hromkovic et al., GOSSIPING IN VERTEX-DISJOINT PATHS MODE IN D-DIMENSIONAL GRIDS AND PLANAR GRAPHS, Information and computation, 123(1), 1995, pp. 17-28
Authors:
FELDMANN R
HROMKOVIC J
MADHAVAPEDDY S
MONIEN B
MYSLIWIETZ P
Citation: R. Feldmann et al., OPTIMAL-ALGORITHMS FOR DISSEMINATION OF INFORMATION IN GENERALIZED COMMUNICATION MODES, Discrete applied mathematics, 53(1-3), 1994, pp. 55-78
Citation: J. Hromkovic et al., THE COMPLEXITY OF SYSTOLIC DISSEMINATION OF INFORMATION IN INTERCONNECTION NETWORKS, Informatique theorique et applications, 28(3-4), 1994, pp. 303-342
Citation: J. Hromkovic et al., DETERMINISTIC VERSUS NONDETERMINISTIC SPACE IN TERMS OF SYNCHRONIZED ALTERNATING MACHINES, Theoretical computer science, 132(1-2), 1994, pp. 319-336
Citation: J. Hromkovic et al., SOME HIERARCHIES FOR THE COMMUNICATION COMPLEXITY-MEASURES OF COOPERATING GRAMMAR SYSTEMS, Theoretical computer science, 127(1), 1994, pp. 123-147
Citation: J. Hromkovic et al., OPTIMAL-ALGORITHMS FOR DISSEMINATION OF INFORMATION IN SOME INTERCONNECTION NETWORKS, Algorithmica, 10(1), 1993, pp. 24-40