An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

artículo científico publicado en 1982

An efficient algorithm for byzantine agreement without authentication

Atomic snapshots of shared memory

Authenticated Algorithms for Byzantine Agreement

Reaching approximate agreement in the presence of faults

article

Relationship between burst properties and sensitivity to input: a theoretical analysis.

artículo científico publicado en 1996

Sharing memory robustly in message-passing systems

artículo científico publicado en 1995

The Byzantine generals strike again

Tomography of scale-free networks and shortest path trees

artículo científico publicado en 2006