Interval Rrouting schemes allow broadcasting with linear message-complexity

Pierre Fraigniaud, Cyril Gavoille, Bernard Mans

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

Original languageEnglish
Title of host publicationNineteenth Annual ACM Symposium on Principles of Distributed Computing
EditorsJames Anderson
Place of PublicationNew York
PublisherACM Press
Pages11-20
Number of pages10
Publication statusPublished - 2000
EventNineteenth Annual ACM Symposium on Principles of Distributed Computing - Portland, USA
Duration: 16 Jul 200019 Jul 2000

Conference

ConferenceNineteenth Annual ACM Symposium on Principles of Distributed Computing
CityPortland, USA
Period16/07/0019/07/00

Cite this

Fraigniaud, P., Gavoille, C., & Mans, B. (2000). Interval Rrouting schemes allow broadcasting with linear message-complexity. In J. Anderson (Ed.), Nineteenth Annual ACM Symposium on Principles of Distributed Computing (pp. 11-20). New York: ACM Press.