1. K.P. Birman and T.A. Joseph. Reliable Communication in the Presence of Failures. ACM Transactions on Computer Systems, 5(1):47-76, February 1987.
2. A. Schiper, J. Eggli, and A. Sandoz. A New Algorithm to Implement Causal Ordering. In, J.-C. Bermond and M. Raynal, editors, Proceedings of the 3rd International Workshop on Distributed Algorithms, volume 392 of Lecture Notes in Computer Science, pages 219-232, Nice, September 1989. Springer-Verlag.
3. B. Charron-Bost, F. Mattern, and G. Tel. Synchronous, Asynchronous, and Causally Ordered Communication. Distributed Computing, 9(4):173-191, February 1996.
4. F. Mattern. Algorithms for Distributed Termination Detection. Distributed Computing, 2(3):161-175, 1987.
5. M. Maekawa. A sqrt(N) Algorithm for Mutual Exclusion in Decentralized Systems. ACM Transactions on Computer Systems, 3(2): 145-159, May 1985.
6. K. Raymond. A Tree-Based Algorithm for Distributed Mutual Exclusion. ACM Transactions on Computer Systems, 7(1):61-77, February 1989.
7. M. Singhal. A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems. IEEE Transactions on Computers, 38(5):651-662, May 1989.
8. R. Obermarck. Distributed Deadlock Detection Algorithm. ACM Transactions on Database Systems, 7(2): 187-208, June 1982.
9. G. Bracha and S. Toueg. Distributed Deadlock Detection. Distributed Computing, 2(3): 127-138, 1987.
10. G.N. Frederickson and N.A. Lynch. Electing a Leader in a Synchronous Ring. Journal of the ACM, 34(1):98-115, January 1987.
11. S. Singh and J.F. Kurose. Electing `Good' Leaders. Journal of Parallel and Distributed Computing, 21(2):184-201, May 1984.
12. L. Bouge. On the Existence of Symmetric Algorithms to Find Leaders in Networks of Communicating Sequential Processes. Acta Informatica, 25(2):179-201, February 1988.
13. D. Dolev and H.R. Strong. Authenticated Algorithms for Byzantine Agreement. SIAM Journal on Computing, 12(4):656-666, November 1983.
14. K.-Q. Yan, Y.H. Chin and S.-C. Wang. Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links. IEEE Transactions on Knowledge and Data Engineering, 4(3):266-280, June 1992.
15. T.D. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225-267, March 1996.
16. K.M. Chandy and J. Misra. How Processes Learn. Distributed Computing, 1(1):40-52, 1986.
17. C. Critchlow and K. Taylor. The Inhibition Spectrum and the Achievement of Causal Consistency. Distributed Computing, 10(1):11-27, 1996.
18. I. Keidar and D. Dolev. Efficient Message Ordering in Dynamic Networks. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 68-76, Philadelphia, May 1996. ACM.
19. T.D. Chandra, V. Hadzilacos, S. Toueg, and B. Charron-Bost. On the Impossibility of Group Membership. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 322-330, Philadelphia, May 1996. ACM.
20. G. Neiger. A New Look at Membership Services. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 331-340, Philadelphia, May 1996. ACM.
21. E.Y. Lotem, I. Keidar, and D. Dolev. Dynamic Voting for Consistent Primary Components. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 63-71, Santa Barbara, August 1997. ACM.
22. A. Adya and B. Liskov. Lazy Consistency Using Loosely Synchronized Clocks. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 73-82, Santa Barbara, August 1997. ACM.
23. U. Maheshwari and B. Liskov. Collecting Distributed Garbage Cycles by Back Tracing. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 239-248, Santa Barbara, August 1997. ACM.