SIGN IN
SIGN UP
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
Full Text:
PDF
Get this Article
Authors:
Christian Glacet
CNR -IEIIT, Torino, Italy
Avery Miller
Université du Québec en Outaouais
Andrzej Pelc
Université du Québec en Outaouais
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 13 Issue 3, August 2017
Article No. 31
ACM
New York, NY
, USA
table of contents
doi>
10.1145/3039870
2017 Article
Research
Refereed
Bibliometrics
· Citation Count: 0
· Downloads (cumulative): 104
· Downloads (12 Months): 84
· Downloads (6 Weeks): 6
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
advice
deterministic distributed algorithm
distributed algorithms
distributed computing models
graph algorithms analysis
leader election
time
trees
Contact Us
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by