Discrete Applied Mathematics 1994: Vol 53 Index

2 Pages·1994·0.29 MB·English

DISCRETE
APPLIED
MATHEMATICS
Discrete Applied Mathematics 53 (1994) 337-338
Author Index
Volume 53 (1994)
Brooks, J.A., see F.L. Van Scoy 321-336
Bruck, J., On optimal broadcasting in faulty hypercubes 3— 13
Chlebus, B.S., K. Diks and A. Pelc, Fast gossiping with short unreliable messages 15— 24
Diks, K., see B.S. Chlebus 15-24
Djelloul, S., Broadcasting in m-dimensional grid graphs with a given neighborhood template 25— 36
Farley, A.M. and A. Proskurowski, Bounded-call broadcasting 37- 53
Feldmann, R., J. Hromkovic, S. Madhavapeddy, B. Monien and P. Mysliwietz, Optimal
algorithms for dissemination of information in generalized communication modes 55— 78
Fraigniaud, P. and E. Lazard, Methods and problems of communication in usual networks 79-133
Gargano, L., A.L. Liestman, J.G. Peters and D. Richards, Reliable broadcasting 135-148
Gerbessiotis, A.V., Broadcasting in random graphs 149-170
GowriSankaran, C., Broadcasting on recursively decomposable Cayley graphs 171-182
Hedetniemi, S.T., see R. Labahn 235-245
Ho, C.-T., see $.L. Johnsson 251-274
Hromkovié, J., see R. Feldmann 55— 78
Klasing, R., B. Monien, R. Peine and E. Stohr, Broadcasting in butterfly
and deBruijn networks 183-197
Konig, J.-C. and E. Lazard, Minimum k-broadcast graphs 199-209
Kortsarz, G. and D. Peleg, Traffic-light scheduling on the grid 211-234
Labahn, R., S.T. Hedetniemi and R. Laskar, Periodic gossiping on trees 235-245
Labahn, R., A minimum broadcast graph on 63 vertices 247-250
Laskar, R., see R. Labahn 235-245
Lazard, E., see P. Fraigniaud 79-133
Lazard, E., see J.-C. Konig 199-209
Lennart Johnsson, S. and C.-T. Ho, Optimal communication channel utilization
for matrix transposition and related permutations on binary cubes 251-274
Liestman, A.L., see L. Gargano 135-148
Madhavapeddy, S., see R. Feldmann 55— 78
Maheo, M. and J.-F. Sacleé, Some minimum broadcast graphs 275-285
Mahéo, M. and J.-F. Saclé, Note on the problem of gossiping in mutlidimensional grids 287-290
Michallon, P. and D. Trystram, Practical experiments of broadcasting algorithms
on a configurable parallel computer 291-298
Monien, B., see R. Feldmann 55— 78
Monien, B., see R. Klasing 183-197
Mysliwietz, P., see R. Feldmann 55— 78
Peine, R., see R. Klasing 183-197
Pelc, A., see B.S. Chlebus 15— 24
Elsevier Science B.V.
338 Discrete Applied Mathematics 53 (1994) 337-338
Peleg, D., see G. Kortsarz 211-234
Peters, J.G., see L. Gargano 135-148
Proskurowski, A., see A.M. Farely 37— 53
Ravishankar, K. and S. Singh, Broadcasting on [0, L] 299-319
Richards, D., see L. Gargano 135-148
Sacle, J.-F., see M. Mahéo 275-285, 287-290
Singh, S., see K. Ravishankar 299-319
Stohr, E., see R. Klasing 183-197
Trystram, D., see P. Michallon 291-298
Van Scoy, F.L. and J.A. Brooks, Broadcasting multiple messages in a grid 321-336