On the time and the bit complexity of distributed randomised anonymous ring colouring.
Yves MétivierJ. M. RobsonNasser Saheb-DjahromiAkka ZemmariPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- peer to peer
- distributed systems
- cooperative
- distributed environment
- worst case
- decision problems
- distributed architecture
- computational complexity
- distributed database systems
- fault tolerant
- multi agent
- magnetic tape
- information systems
- communication cost
- computer networks
- constraint satisfaction problems
- multi agent systems
- search algorithm