The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
暂无分享,去创建一个
[1] Hans L. Bodlaender,et al. Distributed Computing on TRansitive Networks: The Thorus , 1989, STACS.
[2] Hans L. Bodlaender,et al. New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors , 1991, Theor. Comput. Sci..
[3] Manfred K. Warmuth,et al. Gap Theorems for Distributed Computation , 1993, SIAM J. Comput..
[4] Doron Rotem,et al. Lower Bounds for Distributed Maximum-Finding Algorithms , 1984, JACM.
[5] Zvi Galil,et al. Two lower bounds in asynchronous distributed computation , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[6] Yishay Mansour,et al. On the bit complexity of distributed computations in a ring with a leader , 1986, PODC '86.
[7] Yishay Mansour,et al. On the Bit Complexity of Distributed Computations in a Ring with a Leader , 1987, Inf. Comput..
[8] K. Reidemeister. Einführung in die kombinatorische Topologie , 1951 .
[9] David G. Kirkpatrick,et al. Randomized function evaluation on a ring , 1987, Distributed Computing.