Two Absolute Bounds for Distributed Bit Complexity.
Yefim DinitzNoam SolomonPublished in: SIROCCO (2005)
Keyphrases
- worst case
- distributed systems
- distributed environment
- upper bound
- multi agent
- lower bound
- tight bounds
- computer networks
- space complexity
- peer to peer
- error tolerance
- distributed architecture
- lower and upper bounds
- distributed data
- distributed computing
- communication cost
- database
- sensor networks
- cooperative
- information systems
- data mining