3 papers
cs.DC2026
Solving Approximate Agreement on continuous and discrete spaces
Augustin Albert, Sergio Rajsbaum
We consider asynchronous processes prone to crashes, communicating via shared read-write registers, and study the wait-free solvability of approximate agreement: given inputs,…
cs.DC2026
An Epistemic Analysis of Random Coordinated Attack
Sophia Knight, David Lehnherr, Sergio Rajsbaum
The coordinated attack problem models the challenge of coordinating a joint action within a bounded time by communicating over unreliable links. It was the first distributed comput…
cs.DC2026
Lattice Aggregation in Distributed Verification under Crash and Byzantine Failures
Gilde Valeria RodrÃguez, Borzoo Bonakdarpour, Armando Castañeda +1
We introduce c-Lattice Aggregation, a fault-tolerant reconstruction problem for distributed verification under crash and Byzantine failures. In our setting, n asynchronous processe…