AAAAAA
Results:
1-8
|
Results: 8
Authors:
KLASING R
Citation: R. Klasing, THE RELATIONSHIP BETWEEN THE GOSSIP COMPLEXITY IN VERTEX-DISJOINT PATHS MODE AND THE VERTEX BISECTION WIDTH, Discrete applied mathematics, 83(1-3), 1998, pp. 229-246
Authors:
KLASING R
Citation: R. Klasing, IMPROVED COMPRESSIONS OF CUBE-CONNECTED CYCLES NETWORKS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 803-812
Authors:
HECKMANN R
KLASING R
MONIEN B
UNGER W
Citation: R. Heckmann et al., OPTIMAL EMBEDDING OF COMPLETE BINARY-TREES INTO LINES AND GRIDS, Journal of parallel and distributed computing, 49(1), 1998, pp. 40-56
Authors:
KLASING R
LULING R
MONIEN B
Citation: R. Klasing et al., COMPRESSING CUBE-CONNECTED CYCLES AND BUTTERFLY NETWORKS, Networks, 32(1), 1998, pp. 47-65
Authors:
HROMKOVIC J
KLASING R
UNGER W
WAGENER H
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
Authors:
HROMKOVIC J
KLASING R
STOHR EA
WAGENER H
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:
KLASING R
MONIEN B
PEINE R
STOHR EA
Citation: R. Klasing et al., BROADCASTING IN BUTTERFLY AND DEBRUIJN NETWORKS, Discrete applied mathematics, 53(1-3), 1994, pp. 183-197
Authors:
HROMKOVIC J
KLASING R
UNGER W
WAGENER H
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
Risultati:
1-8
|