Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Pierre Fraigniaud Laboratoire de Recherche en Informatique, Bât. 490, Univ. Paris-Sud, 91405 Orsay cedex, France
Cyril Gavoille Laboratoire Bordelais de Recherche en Informatique, Univ. Bordeaux I, 33405 Talence cedex, France
Bernard Mans Department of Computing, Division of ICS, Macquarie Univ., Sydney, NSW 2109, Australia
Published in:
Cover Image
 
· Proceeding
PODC '00 Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Pages 11-20
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-183-6 doi>10.1145/343477.343503
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract) Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 208
· Citation Count: 2


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder