Randomized Local Network Computing, proc. 27th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp.340-349, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01247357
Survey of Distributed Decision, Bulletin of the EATCS, vol.119, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01331880
A Hierarchy of Local Decision, proc. 43rd International Colloquium on Automata, Languages and Programming (ICALP), 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01423644
An optimal local approximation algorithm for max-min linear programs, proc. 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp.260-269, 2009. ,
What can be decided locally without identifiers?, 32nd ACM Symp. on Principles of Dist. Comput. (PODC), pp.157-165, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00912527
On the Impact of Identifiers on Local Decision, proc. 16th Int. Conference on Principles of Distributed Systems (OPODIS), vol.7702, pp.224-238, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01241093
Towards a complexity theory for local distributed computing, Preliminary version in FOCS, vol.60, p.35, 2011. ,
Locally checkable proofs, proc. 30th ACM Symposium on Principles of Distributed Computing (PODC), pp.159-168, 2011. ,
Proof labeling schemes, Distributed Computing, vol.22, issue.4, pp.215-233, 2010. ,
, What cannot be computed locally! In proc. 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp.300-309, 2004.
What can be approximated locally?, proc. 20th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp.46-54, 2008. ,
Leveraging Linial's Locality Limit, proc. 22nd Int. Symp. on Distributed Computing (DISC), pp.394-407, 2008. ,
Locality in Distributed Graph Algorithms, SIAM J. Comp, vol.21, issue.1, pp.193-201, 1992. ,
What Can be Computed Locally?, SIAM J. Comput, vol.24, issue.6, pp.1259-1277, 1995. ,
, Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
Distributed Graph Automata, proc. 30th ACM/IEEE Symposium on Logic in Computer Science (LICS), pp.192-201, 2015. ,
Survey of local algorithms, ACM Comput. Surv, vol.45, issue.2, p.24, 2013. ,
Next, if d 0 = 0, it checks that it has a set S j (u) = {e i | i = 1,. .. , n}. Finally, it checks that the distances are consistent, that is, for every i such that d i = 0, it checks that it has at least one neighbor whose ith distance is smaller than d i, n}, d i is a non-negative integer ,