Keyword

broadcast time

Description: The number of communication rounds required for a broadcast process to reach all vertices in a graph.
OpenAlex ID: keywords/broadcast-time
1981 · P. J. Slater, E. J. Cockayne, et al. · SIAM Journal on Computing · 241
· Bogdan S. Chlebus, Leszek Gasieniec, et al. · 170
2009 · Colin Cooper, Alan Frieze, et al. · SIAM Journal on Discrete Mathematics · 145
2006 · Dariusz R. Kowalski, Andrzej Pelc · Distributed Computing · 127
1979 · A. M. Farley · Networks · 119
2011 · Benjamin Doerr, Mahmoud Fouz, et al. · Electronic Notes in Discrete Mathematics · 117
2003 · Iris Gaber, Yishay Mansour · Journal of Algorithms · 115
1995 · Guy Kortsarz, David Peleg · SIAM Journal on Discrete Mathematics · 113
1995 · Iris Gaber, Yishay Mansour · Symposium on Discrete Algorithms · 113
2010 · Andrea E. F. Clementi, Claudio Macci, et al. · SIAM Journal on Discrete Mathematics · 108
1991 · Michelangelo Grigni, David Peleg · SIAM Journal on Discrete Mathematics · 99
1980 · Arthur M. Farley · SIAM Journal on Applied Mathematics · 83
1988 · Arthur L. Liestman, Joseph G. Peters · SIAM Journal on Discrete Mathematics · 79
1992 · Jean-Claude Bermond, Pavol Hell, et al. · Discrete Applied Mathematics · 77
1999 · James R. Hallmark, Richard N. Armstrong · Journal of Broadcasting & Electronic Media · 76
1989 · S. Even, B. Monien · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · 76
2010 · Nikolaos Fountoulakis, Anna Huber, et al. · IEEE Conference on Computer Communications (INFOCOM) · 73
2014 · Doerr, Benjamin, Friedrich, Tobias, et al. · Apollo (University of Cambridge) · 72
2013 · Mohsen Ghaffari, Bernhard Haeupler · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 71
2012 · Tobias Friedrich, Thomas Sauerwald, et al. · Algorithmica · 69
2012 · Nikolaos Fountoulakis, Konstantinos Panagiotou · Random Structures and Algorithms · 66
1989 · Luisa Gargano, Ugo Vaccaro · Networks · 59
1985 · Arthur L. Liestman · Networks · 59
2010 · David Ilcinkas, Dariusz R. Kowalski, et al. · Theoretical Computer Science · 53
2015 · Andrea Clementi, Pierluigi Crescenzi, et al. · Random Structures and Algorithms · 52
Works count: 363
Citation count: 4,938
Year
Topic
Type