On recognizing a string on an anonymous ring

DOI10.1007/S002240010007MaRDI QIDQ5929085zbMATH OpenOpenAlexWikidataFDO

Authors Evangelos Kranakis, D. Krizanc, Flaminia L. Luccio

Publication date 17 April 2001

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240010007

zbMATH Keywords

Kolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• String recognition on anonymous rings
• On the bit complexity of distributed computations in a ring with a leader
• Language complexity on the synchronous anonymous ring
• Computing on an anonymous ring
• Better computing on the anonymous ring

Cited in

(4)

• Language complexity on the synchronous anonymous ring
• Labeled versus unlabeled distributed Cayley networks
• String recognition on anonymous rings
• Message terminating algorithms for anonymous rings of unknown size

This page was built for publication: On recognizing a string on an anonymous ring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929085)