4 citations · 8 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
A dynamic epistemic logic analysis of the equality negation task
Eric Goubault, Marijana Lazic, Jeremy Ledent +1
In this paper we study the solvability of the equality negation task in a simple wait-free model where processes communicate by reading and writing shared variables or exchanging m…
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…