Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.
Ofer BiranShlomo MoranShmuel ZaksPublished in: WDAG (1990)
Keyphrases
- tight bounds
- upper bound
- distributed systems
- special case
- computational complexity
- worst case
- cooperative
- databases
- distributed environment
- multi agent
- information retrieval
- data sets
- peer to peer
- computer networks
- fault tolerant
- multiscale
- data mining
- neural network
- mobile agents
- transfer learning
- decision problems
- search algorithm
- multi robot
- multiple tasks