| 2026 | SIROCCO | Polynomial Time Local Decision Revisited. | Laurent Feuilloley, Soumyadeep Paul, Ami Paz |
| 2026 | SIROCCO | Proving There Is a Leader Without Naming It. | Laurent Feuilloley, Josef Erik Sedlcek, Martin Slvik |
| 2024 | Algosensors | Decreasing Verification Radius in Local Certification. | Laurent Feuilloley, Jan Janousek, Jan Matys Kristan, Josef Erik Sedlcek |
| 2024 | OPODIS | How Local Constraints Influence Network Diameter and Applications to LCL Generalizations. | Nicolas Bousquet, Laurent Feuilloley, Tho Pierron |
| 2024 | PODC | Brief Announcement: Global certification via perfect hashing. | Nicolas Bousquet, Laurent Feuilloley, Sbastien Zeitoun |
| 2024 | STACS | Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. | Nicolas Bousquet, Laurent Feuilloley, Sbastien Zeitoun |
| 2022 | PODC | What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. | Laurent Feuilloley, Nicolas Bousquet, Tho Pierron |
| 2022 | SSS | Lower Bound for Constant-Size Local Certification. | Virginia Ardvol Martnez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond |
| 2021 | OPODIS | Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. | Llia Blin, Laurent Feuilloley, Gabriel Le Bouder |
| 2021 | OPODIS | Distributed Recoloring of Interval and Chordal Graphs. | Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikal Rabie |
| 2021 | OPODIS | Local Certification of Graph Decompositions and Applications to Minor-Free Classes. | Nicolas Bousquet, Laurent Feuilloley, Tho Pierron |
| 2021 | SODA | The Secretary Problem with Independent Sampling. | Jos Correa, Andrs Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis |
| 2020 | PODC | Compact Distributed Certification of Planar Graphs. | Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, ric Rmila, Ioan Todinca |
| 2020 | SSS | Silent MST Approximation for Tiny Memory. | Llia Blin, Swan Dubois, Laurent Feuilloley |
| 2019 | SODA | Lower bounds for text indexing with mismatches and differences. | Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya |
| 2017 | SIROCCO | How Long It Takes for an Ordinary Node with an Ordinary ID to Output? | Laurent Feuilloley |
| 2016 | ICALP | A Hierarchy of Local Decision. | Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen |
| 2015 | PODC | Brief Announcement: Average Complexity for the LOCAL Model. | Laurent Feuilloley |
| 2015 | SPAA | Randomized Local Network Computing. | Laurent Feuilloley, Pierre Fraigniaud |
| 2014 | LATIN | Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line. | Jos R. Correa, Laurent Feuilloley, Jos A. Soto |