On the Bit Complexity of Distributed Computations in a Ring with a Leader
暂无分享,去创建一个
[1] Danny Dolev,et al. An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.
[2] Hagit Attiya,et al. Computing on an anonymous ring , 1988, JACM.
[3] F. C. Hennie,et al. One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..
[4] Doron Rotem,et al. A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version) , 1982, STOC '82.
[5] Yishay Mansour,et al. On the bit complexity of distributed computations in a ring with a leader , 1986, PODC '86.
[6] Manfred K. Warmuth,et al. Gap theorems for distributed computing , 1986, PODC '86.
[7] Juris Hartmanis. Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.