11 research outputs found

    Distributed Algorithms (Lecture Notes for Course #236357, Spring 1993)

    No full text
    In Proceedings of the Seventh Annual ACM Symp. on Principles of Distributed Computing, 1988, pp. 28--37. [35] R. Gallager. Finding a Leader in a Network with O(E + n log n) Messages, Internal memorandum, MIT. [36] R. Gallager, P. Humblet, and P. Spira. "A Distributed Algorithm for Minimum-Weight Spanning Trees," ACM Transactions on Programming Languages and Systems, Vol. 5, No. 1 (January 1983), pp. 66--77. [37] M. Herlihy. "Impossibility and Universality Results for Wait-Free Synchronization," In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pp. 276--290, August 1988. [38] D. Hirschberg and J. Sinclair. "Decentralized Extrema-Finding in Circular Configurations of Processes," Communications of the ACM, Vol. 23 (November 1980), pp. 627-- 628. [39] L. Higham and T. Przytycka. "A Simple, Efficient Algori
    corecore