Effective Elections for Anonymous Mobile Agents
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 732-743
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Distributed computing on transitive networks: The torus2005
- Distributed Exploration of an Unknown GraphLecture Notes in Computer Science, 2005
- Digraphs Exploration with Little Memory2004
- Can we elect if we cannot compare?2003
- The power of a pebble1998
- Distributed Computing on Anonymous Hypercube NetworksJournal of Algorithms, 1997
- Universal covers of graphs: Isomorphism to depth n − 1 implies isomorphism to all depthsDiscrete Applied Mathematics, 1995
- A modular technique for the design of efficient distributed leader finding algorithmsACM Transactions on Programming Languages and Systems, 1990
- Computing on an anonymous ringJournal of the ACM, 1988
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983