Probabilistic Solitude Verification on a Ring


Matching upper and lower bounds for the bit complexity of a problem on asynchronous unidirectional rings are established, assuming that algorithms must reach a correct conclusion with probability 1-e, for some e > 0. Processors can have identities, but the identities are not necessarily distinct. The problem is that of a distinguished processor verifying… (More)
DOI: 10.1145/10590.10604