Sciweavers

Share
CORR
2008
Springer
97views Education» more  CORR 2008»
8 years 4 months ago
An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
ALGORITHMICA
2010
108views more  ALGORITHMICA 2010»
8 years 4 months ago
An Efficient Algorithm for Batch Stability Testing
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
John Dabney, Brian C. Dean
books