3 papers
cs.DC2021
Byzantine Agreement with Unknown Participants and Failures
Pankaj Khanchandani, Roger Wattenhofer
A set of mutually distrusting participants that want to agree on a common opinion must solve an instance of a Byzantine agreement problem. These problems have been extensively stud…
cs.DS2018
Reducing Compare-and-Swap to Consensus Number One Primitives
Pankaj Khanchandani, Roger Wattenhofer
The consensus number of an object is the maximum number of processes among which binary consensus can be solved using any number of instances of the object and read-write registers…
cs.DC2016
Self-stabilizing Byzantine Clock Synchronization with Optimal Precision
Pankaj Khanchandani, Christoph Lenzen
We revisit the approach to Byzantine fault-tolerant clock synchronization based on approximate agreement introduced by Lynch and Welch. Our contribution is threefold: (1) We provid…