๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Recognizing a String on an Anonymous Ring

โœ Scribed by E. Kranakis; D. Krizanc; F. L. Luccio

Book ID
105915340
Publisher
Springer
Year
2000
Tongue
English
Weight
63 KB
Volume
34
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Rings-on-a-string chain structure in DNA
Rings-on-a-string chain structure in DNA
โœ Miyazawa, Naomi; Sakaue, Takahiro; Yoshikawa, Kenichi; Zana, Raoul ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› American Institute of Physics ๐ŸŒ English โš– 683 KB
Optimal Algorithms for Probabilistic Sol
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
โœ Lisa Higham; David Kirkpatrick; Karl Abrahamson; Andrew Adler ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 340 KB

Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, called contenders, determine whether or not there