… problem II if a computation of A started on a configuration R ends with a ring output that is
a … Most problems we consider consist of computing a function f: A computation started with …

We consider a bidirectional ring of n processors, where processors are anonymous, ie, are
indistinguishable. In this model it is known that “most” functions (in particular XOR and …

… for anonymous rings. They have characterized the class of functions computable on a ring
… (or bit) complexity of computing a function on a ring. Yamashita and Kameda [YaK87b] have …

… than in the anonymous case. Some techniques developed in this paper for rings are likely to
… ], where the “probabilistic” distributed bit complexity of anonymous rings is shown to be 9(n,/…

… In this paper we have discussed the problem of computing on anonymous wireless rings.
We gave algorithms for input collection, which unlike in the case of the standard hardware …

… of ring-based anonymous systems, including popular ring-based anonymous cryptocurrencies
… actions while remaining anonymous among a set of decoy users, known as a “ring” in …

… all the processors in the ring are identical (anonymous [ASW]), … for anonymous rings it takes
f~(n logn) bits to compute any … that the processors are anonymous by allowing each of the …

… { f is computable on an unoriented ring , f is invariant under cyclic shifts and reversals … rings
of arbitrarily large size. Also, the authors give upper and lower bounds for computing on a ring…

… compute. On the other hand, Moran and Warmuth [11] gave an (n log n) lower bound for
computing … complexity of computing boolean functions on an anonymous ring by concentrating …

… As we know, conditionally anonymous ring signature can be regarded as a special kind
of ring signature. Under certain conditions, the authority can confirm the actual signer. …