The complexity of systolic dissemination of information in interconnection networks
RAIRO-Theor. Inf. Appl., 28 3-4 (1994) 303-342
Published online: 2017-02-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the complexity of bandwidth allocation in radio networks
Ralf Klasing, Nelson Morales and Stéphane PérennesTheoretical Computer Science 406 (3) 225 (2008)
https://doi.org/10.1016/j.tcs.2008.06.048
Lower bounds on systolic gossip
Michele Flammini and Stéphane PérennèsInformation and Computation 196 (2) 71 (2005)
https://doi.org/10.1016/j.ic.2004.09.002
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols
Michele Flammini and Stéphane PérennèsSIAM Journal on Discrete Mathematics 17 (4) 521 (2004)
https://doi.org/10.1137/S0895480101386450
Distributed Computing
Ganesh Narayanaswamy, Anil M. Shende and Praveen VipranarayananLecture Notes in Computer Science, Distributed Computing 2571 98 (2002)
https://doi.org/10.1007/3-540-36385-8_10
On the Optimality of General Lower Bounds for Broadcasting and Gossiping
Michele Flammini and Stéphane PérennèsSIAM Journal on Discrete Mathematics 14 (2) 267 (2001)
https://doi.org/10.1137/S0895480199365397
On the history of computer science, computer engineering, and computer technology development in Slovakia
J. Dujnic, N. Fristacky, L. Molnar, I. Plander and B. RovanIEEE Annals of the History of Computing 21 (3) 38 (1999)
https://doi.org/10.1109/85.778981
Periodic gossiping in back-to-back trees
Roger Labahn and André RaspaudDiscrete Applied Mathematics 75 (2) 157 (1997)
https://doi.org/10.1016/S0166-218X(96)00086-8