Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time.

Yoram Moses Orli Waarts

Published in: J. Algorithms (1994)

Keyphrases

fault tolerant
multi agent
special case
tree structure
cooperative
data structure
worst case
approximation algorithms
hidden markov models
polynomial size
approximation ratio
natural language processing
upper bound
real time
social networks
neural network
data sets