论文信息 - The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case

The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case

The distributed bit complexity of an asynchronous network of processors is a lower bound on the worst case bit complexity of computing any non-constant function of the inputs to the processors [MW]. This concept attempts to capture the amount of communication required for any useful computation on the network.

Manfred K. Warmuth | Shlomo Moran | Hans L. Bodlaender

[1] Yishay Mansour,et al. On the Bit Complexity of Distributed Computations in a Ring with a Leader , 1987, Inf. Comput..

[2] Manfred K. Warmuth,et al. Gap theorems for distributed computing , 1986, PODC '86.

[3] Zvi Galil,et al. Two lower bounds in asynchronous distributed computation , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4] Doron Rotem,et al. Lower Bounds for Distributed Maximum-Finding Algorithms , 1984, JACM.

[5] Hans L. Bodlaender,et al. Distributed Computing on TRansitive Networks: The Thorus , 1989, STACS.

[6] Hans L. Bodlaender,et al. New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors , 1991, Theor. Comput. Sci..

[7] David G. Kirkpatrick,et al. Randomized Function Evaluation on a Ring , 1987 .