On recognizing a string on an anonymous ring

Theory of Computing Systems

Volumn 34, Issue 1, 2000, Pages 3-12

  Kranakis, E ^a   Krizanc, D ^b   Luccio, F L ^c  

^a CARLETON UNIVERSITY   (Canada)

^b WESLEYAN UNIVERSITY   (United States)

^c UNIVERSITY OF TRIESTE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

BINARY STRING; BIT COMPLEXITY; KOLMOGOROV COMPLEXITY; LOWER BOUNDS; NEAR-OPTIMAL; OPTIMAL ALGORITHM; RANDOM STRING; UPPER AND LOWER BOUNDS;

COMPUTER SCIENCE;

EID: 0035605817     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240010007     Document Type: Article

References (13)

1. H. Attiya and Y. Mansour, Language Complexity on the Synchronous Anonymous Ring, Theoretical Computer Science, 53, 169-185 (1987).
2. H. Attiya, M. Snir and M. Warmuth, Computing on an Anonymous Ring, Journal of the ACM, 35(4), 845-875 (1988).
3. P.W. Beame and H.L. Bodlaender, Distributed Computing on Transitive Networks: the Torus, Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science, STACS, LNCS 349, pp. 294-303, Springer-Verlag, Berlin, 1989.
4. H.L. Bodlaender, S. Moran and M.K. Warmuth, The Distributed Bit Complexity of the Ring: from the Anonymous to the Non-Anonymous Case, Information and Computation, 108(1), 34-50 (1994).
5. P. Ferragina, A. Monti and A. Roncato, Trade-off between Computation Power and Common Knowledge in Anonymous Rings, Proceedings of the Colloquium on Structural Information and Communication Complexity, Ottawa, pp. 35-48, 1994.
6. O. Goldreich and L. Shrara, On the Complexity of Global Computation in the Presence of Link Failures: the Case of Ring Configuration, Distributed Computing, 5(3), 121-131 (1991).
7. E. Kranakis and D. Krizanc, Computing Boolean Functions on Cayley Networks, Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, Arlington, Texas, pp. 222-229, 1992.
8. E. Kranakis and D. Krizanc, Distributed Computing on Anonymous Hypercube Networks, Journal of Algorithms, 23(1), 32-50 (1997).
9. E. Kranakis, D. Krizanc and F. Luccio, String Recognition on Anonymous Rings, Technical Report 256, School of Computer Science, Carleton University, Ottawa, 1994.
10. M. Li and P.M.B. Vitanyi, Kolmogorov Complexity and its Applications, in Handbook of Theoretical Computer Science, Algorithms and Complexity, pp. 187-254, The MIT Press, Cambridge, Massachusetts, 1990.
11. S. Moran and M.K. Warmuth, Gap Theorems for Distributed Computation, SIAM Journal of Computing, 22(2), 379-394 (1993).
12. J. Seiferas, A Simplified Lower Bound for Context-Free Language Recognition, Information and Control, 69, 255-260 (1986).
13. A.K. Zvonkin and L.A. Levin, The Complexity of Finite Objects and the Development of the Concepts of Information and Randomness by Means of the Theory of Algorithms, Russian Mathematical Surveys, 25, 83-124 (1970).