Author:
Fusco Emanuele Guido,Pelc Andrzej,Petreschi Rossella
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 547–556 (2001)
2. Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pp. 82–93 (1980)
3. Attiya, H., Snir, M., Warmuth, M.: Computing on an anonymous ring. Journal of the ACM 35, 845–875 (1988)
4. Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. Journal of the ACM 37, 524–548 (1990)
5. Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In: Proc. 19th Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 230–240 (1987)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Time vs. Information Tradeoffs for Leader Election in Anonymous Trees;ACM Transactions on Algorithms;2017-08-09
2. Election vs. Selection;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11
3. Topology recognition and leader election in colored networks;Theoretical Computer Science;2016-03
4. Fast rendezvous with advice;Theoretical Computer Science;2015-12
5. Tradeoffs between cost and information for rendezvous and treasure hunt;Journal of Parallel and Distributed Computing;2015-09