 Tight Bounds on the Message Complexity of Distributed Tree VerificationInternational Conference on Principles of Distributed Systems (OPODIS), 2024 |
 Computing Power of Hybrid Models in Synchronous NetworksInternational Conference on Principles of Distributed Systems (OPODIS), 2022 |
 What can be certified compactly?ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 Nicolas Bousquet Laurent Feuilloley Théo Pierron |
 Local certification of MSO properties for bounded treedepth graphs Nicolas Bousquet Laurent Feuilloley Théo Pierron |
 Local certification of graph decompositions and applications to
minor-free classesInternational Conference on Principles of Distributed Systems (OPODIS), 2021 Nicolas Bousquet Laurent Feuilloley Théo Pierron |
 Twenty-Two New Approximate Proof Labeling Schemes (Full Version)International Symposium on Distributed Computing (DISC), 2020 |
 Distributed Maximum Matching Verification in CONGESTInternational Symposium on Distributed Computing (DISC), 2020 |
 Introduction to local certificationDiscrete Mathematics & Theoretical Computer Science (DMTCS), 2019 Laurent Feuilloley |
 |
 Trade-offs in Distributed Interactive ProofsInternational Symposium on Distributed Computing (DISC), 2019 |
 What graph neural networks cannot learn: depth vs widthInternational Conference on Learning Representations (ICLR), 2019 |
 Silent MST approximation for tiny memorySafety-critical Systems Symposium (SSS), 2019 |
 Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader
Election AlgorithmsInternational Conference on Principles of Distributed Systems (OPODIS), 2019 |
 Identifiers in Registers - Describing Network Algorithms with LogicFoundations of Software Science and Computation Structure (FOSSACS), 2018 |
 |
 |
 Distributed Detection of CyclesACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017 |
 |
 |
 How Long It Takes for an Ordinary Node with an Ordinary ID to Output? Laurent Feuilloley |
 |
