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:
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: 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
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
Citation: J. Hromkovic et al., OPTIMAL-ALGORITHMS FOR DISSEMINATION OF INFORMATION IN SOME INTERCONNECTION NETWORKS, Algorithmica, 10(1), 1993, pp. 24-40