Author:
Anagnostou Efthymios,El-Yaniv Ran
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. E. Anagnostou, R. El-Yaniv, and V. Hadzilacos. Fast and Simple Self-Stabilizing Algorithms, 1991. In preparation.
2. E. Anagnostou, R. El-Yaniv, and H. Tamaki. A Self Stabilizing Reduction and Applications, 1991. Unpublished Manuscript.
3. E. Arjomandi, M. Fisher, and N. Lynch. Efficiency of Synchronous Versus Asynchronous Distributed Systems. Journal of the ACM, 30 (3):449–456, 1983.
4. R. Aleliunas, R. Karp, R. Lipton, L. Lovász, and C. Rackoff. Random walks, Universal traversal sequences, and the complexity of maze problems. In Proc. of the 20th Annual Symposium on Foundations of Computer Science, pages 218–223, 1979.
5. Y. Afek, S. Kutten, and M. Yung. Memory-Efficient Self Stabilizing Protocols for General Networks. In 4th IWDAG, pages 15–28, Bari, Italy, September, 1990.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献