Proving time bounds for randomized distributed algorithms.

Nancy A. Lynch Isaac Saias Roberto Segala

Published in: CoRR (1994)

Keyphrases

randomized algorithms
computational cost
worst case
times faster
error bounds
data structure
computational complexity
upper bound
upper and lower bounds
distributed constraint optimization
neural network
search algorithm
lower bound
significant improvement
benchmark datasets
computational efficiency