Polynomial end-to-end communication
暂无分享,去创建一个
[1] Amos Israeli,et al. Bounded time-stamps , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[2] Adrian Segall,et al. Reliable link initialization procedures , 1988, IEEE Trans. Commun..
[3] Baruch Awerbuch,et al. Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4] S. Finn. Resynch Procedures and a Fail-Safe Network Protocol , 1979, IEEE Trans. Commun..
[5] Edsger W. Dijkstra,et al. A method of programming , 1988 .
[6] Uzi Vishkin. An efficient distributed orientation algorithm , 1983, IEEE Trans. Inf. Theory.
[7] Leslie Lamport,et al. The mutual exclusion problem: partII—statement and solutions , 1986, JACM.
[8] Nir Shavit,et al. Bounded concurrrent time-stamp systems are constructible , 1989, STOC '89.
[9] S. Wecker,et al. DNA: The Digital Network Architecture , 1980, IEEE Trans. Commun..
[10] Baruch Awerbuch,et al. A quantitative approach to dynamic networks , 1990, PODC '90.
[11] Baruch Awerbuch,et al. Dynamic networks are as fast as static networks , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[12] Nancy A. Lynch,et al. Data link layer: two impossibility results , 1988, PODC '88.
[13] Yehuda Afek,et al. End-to-end communication in unreliable networks , 1988, PODC '88.
[14] Ravindra K. Ahuja,et al. A Fast and Simple Algorithm for the Maximum Flow Problem , 2011, Oper. Res..
[15] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[16] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[17] Baruch Awerbuch,et al. Reliable broadcast protocols in unreliable networks , 1986, Networks.