32 citations · 76 across the 27 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DC2017
Error-Sensitive Proof-Labeling Schemes
Laurent Feuilloley, Pierre Fraigniaud
Proof-labeling schemes are known mechanisms providing nodes of networks with certificates that can be verified locally by distributed algorithms. Given a boolean predicate on netwo…
cs.DC2017
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
Laurent Feuilloley
In the context of distributed synchronous computing, processors perform in rounds, and the time-complexity of a distributed algorithm is classically defined as the number of rounds…