Deploying Wireless Networks with Beeps, DISC, pp.148-162, 2010. ,
DOI : 10.1007/978-3-642-15763-9_15
URL : http://theory.csail.mit.edu/tds/papers/Cornejo/disc10.pdf
Distributed information processing in biological and computational systems, Communications of the ACM, vol.58, issue.1, pp.94-102, 2014. ,
DOI : 10.1073/pnas.0508637103
Byzantine Fireflies, DISC, pp.47-59, 2015. ,
DOI : 10.1007/978-3-662-48653-5_4
URL : https://hal.archives-ouvertes.fr/hal-01199818
Beeping a maximal independent set, Distributed Computing, pp.195-208, 2013. ,
Listing all maximal cliques in large sparse real-world graphs, SEA, pp.364-375, 2011. ,
Decomposition of Finite Graphs Into Forests, Journal of the London Mathematical Society, vol.1, issue.1, p.12, 1964. ,
DOI : 10.1112/jlms/s1-39.1.12
Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis ArXiv e-prints, 2016. ,
Feedback from nature, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.147-156, 2013. ,
DOI : 10.1145/2484239.2484247
Design Patterns in Beeping Algorithms, OPODIS, pp.1-1516, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01472903
What Is the Use of Collision Detection (in Wireless Networks)?, DISC, pp.133-147, 2010. ,
DOI : 10.1007/978-3-642-15763-9_14
Distributed Computing: A Locality-Sensitive Approach, ser. Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, vol.6950, 2000. ,
DOI : 10.1007/978-3-642-24100-0
Deterministic Leader Election in Multi-hop Beeping Networks, DISC, pp.212-226, 2014. ,
DOI : 10.1007/978-3-662-45174-8_15
Fast Beeping Protocols for Deterministic MIS and (?+1)-Coloring in Sparse Graphs (Extended Version) ,
URL : https://hal.archives-ouvertes.fr/hal-01679099
Network decomposition and locality in distributed computation, 30th Annual Symposium on Foundations of Computer Science, pp.364-369, 1989. ,
DOI : 10.1109/SFCS.1989.63504
Distributed Graph Coloring: Fundamentals and Recent Developments, Synthesis Lectures on Distributed Computing Theory, vol.5, issue.1, 2013. ,
DOI : 10.4086/toc.2007.v003a006
On a game in directed graphs, Information Processing Letters, vol.83, issue.1, pp.13-16, 2002. ,
DOI : 10.1016/S0020-0190(01)00309-X
Deterministic distributed vertex coloring in polylogarithmic time, PODC, pp.410-419, 2010. ,
Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth, SIROCCO, pp.246-257, 2011. ,
DOI : 10.1145/1835698.1835760
Symmetry breaking depending on the chromatic number or the neighborhood growth, Theoretical Computer Science, vol.509, pp.40-50, 2013. ,
DOI : 10.1016/j.tcs.2012.09.004
Deterministic Leader Election in $$O(D+\log n)$$ Time with Messages of Size O(1), DISC, pp.16-28, 2016. ,
DOI : 10.1017/CBO9781139168724
URL : https://hal.archives-ouvertes.fr/hal-01409014
Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control, vol.70, issue.1, pp.32-53, 1986. ,
DOI : 10.1016/S0019-9958(86)80023-7
Distributed (??+1)-coloring in linear (in ??) time, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.111-120, 2009. ,
DOI : 10.1145/1536414.1536432
Weak graph colorings, Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, SPAA '09, pp.138-144, 2009. ,
DOI : 10.1145/1583991.1584032
Parallel symmetry-breaking in sparse graphs, STOC, pp.315-324, 1987. ,
Sublogarithmic distributed mis algorithm for sparse graphs using nash-williams decomposition, PODC, pp.363-379, 2008. ,
Coloring Powers of Planar Graphs, SIAM Journal on Discrete Mathematics, vol.16, issue.4, pp.651-662, 2003. ,
DOI : 10.1137/S0895480100367950