Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Awerbuch, B. Complexity of Network Synchronization. JACM 32(4), October, 1985, pp. 804–823.
2. Bagrodia, R. A distributed algorithm to implement the generalized alternative command of CSP. The 6th International Conference on Distributed Computing Systems, May 1986, pp. 422–427.
3. Bagrodia, R. A distributed algorithm to implement N-party rendezvous. The 7th Conference on Foundations of Software Technology and Computer Science, Pune, India, December 1987. Lecture Notes in Computer Science 287, Springer Verlag, 1987.
4. Birman, K.P., and Joseph, T.A. Reliable Communication in the Presence of Failures. ACM Transactions on Computer Systems, 5(1):47–76, 1987.
5. Bloom, B. Constructing Two-Writer Atomic Registers. 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August, 1987, pp. 249–259. Also, to appear in Special Issue of IEEE Transactions on Computing, on Parallel and Distributed Algorithms.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献