Laurent Feuilloley

Team(s)	GOAL
Institution	Centre National de la Recherche Scientifique
Location	Nautibus (Université Lyon1)
Email	laurent.feuilloley at liris.cnrs.fr

Personal page	https://perso.liris.cnrs.fr/lfeuilloley

Publications LIRIS pour Laurent Feuilloley (20)

Nicolas Bousquet, Laurent Feuilloley & Théo Pierron (2024). "Local certification of graph decompositions and applications to minor-free classes". Journal of Parallel and Distributed Computing. doi : https://doi.org/10.1016/j.jpdc.2024.104954. HAL : hal-03772974. .

Nicolas Bousquet, Laurent Feuilloley & Sébastien Zeitoun (2024). "Local certification of local properties: tight bounds, trade-offs and new parameters". 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), 14 mars 2024, Clermont - Ferrand (France). doi : 10.4230/LIPIcs.STACS.2024.21. ArXiv : 2312.13702. HAL : hal-04440851. .

Nicolas Bousquet, Louis Esperet, Laurent Feuilloley & Sébastien Zeitoun (2024). "Renaming in distributed certification". ArXiv : 2409.15404. HAL : hal-04722289. .

Lélia Blin, Laurent Feuilloley & Gabriel Le Bouder (2023). "Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms". Discrete Mathematics and Theoretical Computer Science, vol. 25, #1, p. 5. doi : 10.46298/dmtcs.9335. ArXiv : 1905.08563v3. HAL : hal-03536828. .
Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi & Jean-Florent Raymond (2023). "A lower bound for constant-size local certification". Theoretical Computer Science, vol. 971, p. 114068. doi : 10.1016/j.tcs.2023.114068. ArXiv : 2208.14229. HAL : hal-03874894.
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila & Ioan Todinca (2023). "Local Certification of Graphs with Bounded Genus". Discrete Applied Mathematics, vol. 325, pp. 9-36. doi : 10.1016/j.dam.2022.10.004. ArXiv : 2007.08084. HAL : hal-03663680. .

Swan Dubois, Laurent Feuilloley, Franck Petit & Mikaël Rabie (2023). "When Should You Wait Before Updating? Toward a Robustness Refinement". 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023), 21 juin 2023, Pisa (Italy), 7:1-7:15. doi : 10.4230/LIPIcs.SAND.2023.7. ArXiv : 2304.05831. HAL : hal-04101692. .

Guillaume Ducoffe, Michel Habib, François Pitois & Laurent Feuilloley (2023). "Pattern detection in ordered graphs". ArXiv : 2302.11619. HAL : hal-04003273.

Laurent Feuilloley & Pierre Fraigniaud (2022). "Error-Sensitive Proof-Labeling Schemes". Journal of Parallel and Distributed Computing, vol. 166, pp. 149-165. doi : 10.1016/j.jpdc.2022.04.015. HAL : hal-03650181. .

Nicolas Bousquet, Laurent Feuilloley & Théo Pierron (2022). "What Can Be Certified Compactly?". PODC '22: ACM Symposium on Principles of Distributed Computing, 25 juillet 2022, Salerno (Italy), pp. 131-140. doi : 10.1145/3519270.3538416. ArXiv : 2202.06065. HAL : hal-03773011. .
Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi & Jean-Florent Raymond (2022). "A lower bound for constant-size local certification". Stabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France, 17 novembre 2022, Clermont-Ferrand (France), p. 114068. doi : 10.1007/978-3-031-21017-4_16. ArXiv : 2208.14229. HAL : hal-03874784. .
Lélia Blin, Laurent Feuilloley & Gabriel Le Bouder (2022). "Borne inférieure optimale pour la complexité spatiale des algorithmes déterministes auto-stabilisants d'élection". AlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 3 juin 2022, Saint-Rémy-Lès-Chevreuse (France). HAL : hal-03651152. .

Laurent Feuilloley & Michel Habib (2022). "Classifying grounded intersection graphs via ordered forbidden patterns". ArXiv : 2112.00629. HAL : hal-03663668. .
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich & Mikaël Rabie (2022). "Short and local transformations between ($\Delta+1$)-colorings". ArXiv : 2203.08885. HAL : hal-03663638. .

Laurent Feuilloley & Pierre Fraigniaud (2021). "Randomized local network computing : Derandomization beyond locally checkable labelings". ACM Transactions on Parallel Computing, vol. 8, #4, pp. 1-25. doi : 10.1145/3470640. HAL : hal-03610006. .
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila & Ioan Todinca (2021). "Compact Distributed Certification of Planar Graphs". Algorithmica, vol. 83, #7, pp. 2215-2244. doi : 10.1007/s00453-021-00823-w. ArXiv : 2005.05863. HAL : hal-03540582. .
Laurent Feuilloley & Michel Habib (2021). "Graph classes and forbidden patterns on three vertices". SIAM Journal on Discrete Mathematics, vol. 35, #1, pp. 55-90. doi : 10.1137/19M1280399. HAL : hal-04101700. .
Laurent Feuilloley (2021). "Introduction to local certification". Discrete Mathematics and Theoretical Computer Science. doi : 10.46298/dmtcs.6280. ArXiv : 1910.12747. HAL : hal-03615706. .

Nicolas Bousquet, Laurent Feuilloley & Théo Pierron (2021). "Local Certification of Graph Decompositions and Applications to Minor-Free Classes". 25th International Conference on Principles of Distributed Systems, OPODIS 2021, 13 décembre 2021, Strasbourg (France). doi : 10.4230/LIPIcs.OPODIS.2021.22. HAL : hal-03610456. .
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich & Mikaël Rabie (2021). "Distributed Recoloring of Interval and Chordal Graphs". 25th International Conference on Principles of Distributed Systems, OPODIS 2021, 13 décembre 2021, Strasbourg (France). doi : 10.4230/LIPIcs.OPODIS.2021.19. HAL : hal-03610449. .