A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms
Jan K. PachlEphraim KorachDoron RotemPublished in: STOC (1982)
Keyphrases
- lower bound
- learning algorithm
- optimization problems
- worst case
- computationally efficient
- objective function
- computational cost
- peer to peer
- upper and lower bounds
- cooperative
- computational complexity
- significant improvement
- machine learning
- distributed systems
- distributed environment
- memory requirements
- online algorithms
- distributed constraint optimization