Lower Bounds for Distributed Maximum-Finding Algorithms.

Jan K. Pachl Ephraim Korach Doron Rotem

Published in: J. ACM (1984)

Keyphrases

lower bound
machine learning algorithms
worst case
learning algorithm
computational complexity
multi agent
data structure
theoretical analysis
benchmark datasets
orders of magnitude
data sets
machine learning
significant improvement
upper bound
computationally efficient
online algorithms