On the bit complexity of distributed computations in a ring with a leader
暂无分享,去创建一个
[1] Greg N. Frederickson,et al. Tradeoffs for selection in distributed networks (Preliminary Version) , 1983, PODC '83.
[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[3] Nicola Santoro,et al. Distributed algorithms for finding centers and medians in networks , 1984, TOPL.
[4] Juris Hartmanis. Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.
[5] Gary L. Peterson,et al. An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.
[6] Hagit Attiya,et al. Computing on an anonymous ring , 1988, JACM.
[7] Doron Rotem,et al. A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version) , 1982, STOC '82.
[8] K. Mani Chandy,et al. A Distributed Graph Algorithm: Knot Detection , 1982, TOPL.
[9] Danny Dolev,et al. An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.
[10] Manfred K. Warmuth,et al. Gap theorems for distributed computing , 1986, PODC '86.
[11] F. C. Hennie,et al. One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..