Sciweavers

316 search results - page 64 / 64
» An Achievability Result for the General Relay Channel
Sort
View
PODC
2012
ACM
11 years 7 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang