Showing cs.DCShow all
2 papers · 1 filter
cs.DC2008
An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
Consider an asynchronous system with private channels and processes, up to of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement…
cs.DC2005
Papillon: Greedy Routing in Rings
Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku
We study {\sc greedy} routing over nodes placed in a ring, with the \emph{distance} between two nodes defined to be the clockwise or the absolute distance between them along th…