Election and Local Computations on Edges-Reference-Cited by-同舟云学术

Election and Local Computations on Edges

Published:2004 Issue: Volume: Page:90-104
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chalopin Jérémie,Métivier Yves

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24727-2_8

Reference23 articles.

1. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)

2. Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. McGraw-Hill, New York (1998)

3. Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proc. 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26. IEEE Press, Los Alamitos (1996)

4. Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on principles of distributed computing, pp. 181–188. ACM Press, New York (1999)

5. Lecture Notes in Computer Science;P. Boldi,2001

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Election vs. Selection;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11

2. Knowledge, level of symmetry, and time of leader election;Distributed Computing;2014-12-05

3. Leader election for anonymous asynchronous agents in arbitrary networks;Distributed Computing;2013-09-03

4. How much memory is needed for leader election;Distributed Computing;2011-04-09

5. Graph labelings derived from models in distributed computing: A complete complexity classification;Networks;2011-03-10