Computing on an anonymous ring
暂无分享,去创建一个
[1] Journal of the Association for Computing Machinery , 1961, Nature.
[2] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.
[3] Nancy A. Lynch,et al. Electing a leader in a synchronous ring , 1987, JACM.
[4] Manfred K. Warmuth,et al. Gap theorems for distributed computing , 1986, PODC '86.
[5] L PetersonGary. An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982 .
[6] Doron Rotem,et al. A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version) , 1982, STOC '82.
[7] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[8] Doron Rotem,et al. Lower Bounds for Distributed Maximum-Finding Algorithms , 1984, JACM.
[9] Danny Dolev,et al. An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.
[10] Daniel S. Hirschberg,et al. Decentralized extrema-finding in circular configurations of processors , 1980, CACM.
[11] Hagit Attiya,et al. Language Complexity on the Synchronous Anonymous Ring , 1987, Theor. Comput. Sci..
[12] Andrzej Ehrenfeucht,et al. Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions , 1975, Theor. Comput. Sci..