Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Y. Afek and E. Gafni, "Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks," Proc. 4th ACM Sympos. Principles of Distributed Computing, Minacki, Ontario, pp. 186–195, Aug. 1985.
2. P. A. Alsberg and J. D. Day, "A Principle for Resilient Sharing of Distributed Resources," Proc. 2nd Int. Conf. Software Eng., San Fransisco, pp. 562–570, Oct. 1976.
3. J. E. Burns, "A Formal Model for Message Passing Systems," Technical Report TR-91, Indiana U., Bloomington, May 1980.
4. I. A. Cimet and P. R. S. Kumar, "A Resilient Distributed Protocol for Network Synchronization," ACM SIGCOMM Symp. Commun. Arch. and Protocols, Stowe, VT, pp. 358–367, Aug. 1986.
5. M. J. Fischer, N. A. Lynch, and M. S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," J. ACM, vol. 32, pp. 374–382, April 1985.