Slide-The Key to Polynomial End-to-End Communication
暂无分享,去创建一个
[1] Baruch Awerbuch,et al. An Efficient Topology Update Protocol for Dynamic Networks , 1992, WDAG.
[2] Yehuda Afek,et al. End-to-end communication in unreliable networks , 1988, PODC '88.
[3] P. Merlin,et al. Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock , 1980, IEEE Transactions on Communications.
[4] Nir Shavit,et al. Polynomial end-to-end communication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[5] Baruch Awerbuch,et al. Reliable broadcast protocols in unreliable networks , 1986, Networks.
[6] Edsger W. Dijkstra,et al. A method of programming , 1988 .
[7] Uzi Vishkin. An efficient distributed orientation algorithm , 1983, IEEE Trans. Inf. Theory.
[8] S. Finn. Resynch Procedures and a Fail-Safe Network Protocol , 1979, IEEE Trans. Commun..
[9] Nancy A. Lynch,et al. Reliable communication over unreliable channels , 1994, JACM.
[10] S. Wecker,et al. DNA: The Digital Network Architecture , 1980, IEEE Trans. Commun..
[11] Rafail Ostrovsky,et al. Log-Space Polynomial End-to-End Communication , 1998, SIAM J. Comput..
[12] Adrian Segall,et al. Reliable link initialization procedures , 1988, IEEE Trans. Commun..
[13] Baruch Awerbuch,et al. Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[14] Yehuda Afek,et al. The slide mechanism with applications in dynamic networks , 1992, PODC '92.
[15] Baruch Awerbuch,et al. A quantitative approach to dynamic networks , 1990, PODC '90.
[16] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[17] Baruch Awerbuch,et al. A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[18] Boaz Patt-Shamir,et al. Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[19] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.
[20] Baruch Awerbuch,et al. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.
[21] Bruce M. Maggs,et al. Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.
[22] B. Awerbuch,et al. Distributed program checking: a paradigm for building self-stabilizing distributed protocols , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[23] Nancy A. Lynch,et al. Data link layer: two impossibility results , 1988, PODC '88.
[24] Baruch Awerbuch,et al. Dynamic networks are as fast as static networks , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.