Improvements in the time complexity of two message-optimal election algorithms

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Eli Gafni Computer Science Department, University of California, Los Angeles, CA
Published in:
· Proceeding
PODC '85 Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Pages 175-185
ACM New York, NY, USA ©1985
table of contents ISBN:0-89791-168-7 doi>10.1145/323596.323612
Improvements in the time complexity of two message-optimal election algorithms Published by ACM 1985 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 6
· Downloads (cumulative): 299
· Citation Count: 22


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