Can we elect if we cannot compare?

doi:10.1145/777412.777469

SIGN IN SIGN UP

Can we elect if we cannot compare?

Full Text:

Pdf

Buy this Article

Authors:	Lali Barrière	Universita Politècnica de Catalunya, Barcelona, Spain
	Paola Flocchin	University of Ottawa, Ottawa, Canada
	Pierre Fraigniau	Université Paris Sud, Orsay, France
	Nicola Santor	Carleton University, Ottawa, Canada

	2003 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 8 · Citation Count: 14

Published in:

	· Proceeding
	SPAA '03 Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
	ACM New York, NY, USA ©2003 table of contents ISBN:1-58113-661-7 doi>10.1145/777412.777469

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- SPAA '12

Share:

|

Tags: algorithms anonymous networks cayley graphs distributed computing distributed systems election mobile agents rendezvous theory

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 Digital Library is published by the Association for Computing Machinery. Copyright © 2012 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