Computing Anonymously with Arbitrary Knowledge

We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (in particular, we do not assume that a bound on the network size is known). Three activation models are considered (synchronous, asynchronous, interleaved).

• Type: Conference
• Year: 1999
• Where: PODC
• Authors: Paolo Boldi, Sebastiano Vigna
• Keywords: Arbitrary Knowledge, Characterizations, Distributed And Parallel Computing, Network Size, PODC 1999