SIGN IN
SIGN UP
Memory space requirements for self-stabilizing leader election protocols
Full Text:
PDF
Buy this Article
Authors:
Joffroy Beauquier
L.R.I./C.N.R.S., Université de Paris-Sud, bat 490, 91405 Orsay Cedex, France
Maria Gradinariu
L.R.I./C.N.R.S., Université de Paris-Sud, bat 490, 91405 Orsay Cedex, France
Colette Johnen
L.R.I./C.N.R.S., Université de Paris-Sud, bat 490, 91405 Orsay Cedex, France
Published in:
· Proceeding
PODC '99
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Pages 199-207
ACM
New York, NY
, USA
©1999
table of contents
ISBN:1-58113-099-6
doi>
10.1145/301308.301358
1999 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 14
· Downloads (cumulative): 365
· Citation Count: 24
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
computability theory
decidability
distributed architectures
fault tolerance
leader election
memory space requirement
mutual exclusion
reliability, availability, and serviceability
self-stabilization
theory
verification
Feedback
|
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
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder