AAAAAA
Results:
1-10
|
Results: 10
Authors:
BEZRUKOV S
MONIEN B
UNGER W
WECHSUNG G
Citation: S. Bezrukov et al., EMBEDDING LADDERS AND CATERPILLARS INTO THE HYPERCUBE, Discrete applied mathematics, 83(1-3), 1998, pp. 21-29
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:
BRUNE M
GEHRING J
KELLER A
MONIEN B
RAMME F
REINEFELD A
Citation: M. Brune et al., SPECIFYING RESOURCES AND SERVICES IN METACOMPUTING ENVIRONMENTS, Parallel computing, 24(12-13), 1998, pp. 1751-1776
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:
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
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
JESCHKE CD
MONIEN B
Citation: J. Hromkovic et al., NOTE ON OPTIMAL GOSSIPING IN SOME WEAK-CONNECTED GRAPHS, Theoretical computer science, 127(2), 1994, pp. 395-402
Authors:
MONIEN B
RYTTER W
SCHAPERS H
Citation: B. Monien et al., FAST RECOGNITION OF DETERMINISTIC CFLS WITH A SMALL NUMBER OF PROCESSORS (VOL 116, PG 421, 1993), Theoretical computer science, 123(2), 1994, pp. 427-427
Authors:
MONIEN B
RYTTER W
SCHAPERS L
Citation: B. Monien et al., FAST RECOGNITION OF DETERMINISTIC CFLS WITH A SMALLER NUMBER OF PROCESSORS, Theoretical computer science, 116(2), 1993, pp. 421-429
Authors:
HROMKOVIC J
JESCHKE CD
MONIEN B
Citation: J. Hromkovic et al., OPTIMAL-ALGORITHMS FOR DISSEMINATION OF INFORMATION IN SOME INTERCONNECTION NETWORKS, Algorithmica, 10(1), 1993, pp. 24-40
Risultati:
1-10
|