5 citations · 8 across the 3 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DC2019★ 3 cited
Tasks in Modular Proofs of Concurrent Algorithms
Armando Castañeda, Aurélie Hurault, Philippe Quéinnec +1
Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-ch…
cs.DC2019
A Topological Perspective on Distributed Network Algorithms
Armando Castañeda, Pierre Fraigniaud, Ami Paz +3
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems…