Title |
|---|
 Tight Bounds on the Message Complexity of Distributed Tree VerificationInternational Conference on Principles of Distributed Systems (OPODIS), 2024 |
 Local certification of geometric graph classesInternational Symposium on Mathematical Foundations of Computer Science (MFCS), 2023 |
 The Distributed Complexity of Locally Checkable Labeling Problems Beyond
Paths and TreesInformation Technology Convergence and Services (ITCS), 2023 |
 Local Certification of Majority DynamicsConference on Current Trends in Theory and Practice of Informatics (CTTPI), 2023 |
 Distributed Certification for Classes of Dense GraphsInternational Symposium on Distributed Computing (DISC), 2023 |
 Efficient Distributed Decomposition and Routing Algorithms in Minor-Free
Networks and Their ApplicationsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Distributed Quantum Interactive ProofsSymposium on Theoretical Aspects of Computer Science (STACS), 2022 |
 Distributed Merlin-Arthur Synthesis of Quantum States and Its
ApplicationsInternational Symposium on Mathematical Foundations of Computer Science (MFCS), 2022 |
 Computing Power of Hybrid Models in Synchronous NetworksInternational Conference on Principles of Distributed Systems (OPODIS), 2022 |
 MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to
Cooperate AmicablyIACR Cryptology ePrint Archive (IACR ePrint), 2022 |
 Narrowing the LOCALCONGEST Gaps in Sparse Networks via
Expander DecompositionsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Distributed Interactive Proofs for the Recognition of Some Geometric
Intersection Graph ClassesColloquium on Structural Information & Communication Complexity (SIROCCO), 2021 |
 A Meta-Theorem for Distributed CertificationColloquium on Structural Information & Communication Complexity (SIROCCO), 2021 |
 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 |
 Local certification of graphs on surfacesTheoretical Computer Science (TCS), 2021 |
 Compact Distributed Interactive Proofs for the Recognition of Cographs
and Distance-Hereditary GraphsSafety-critical Systems Symposium (SSS), 2020 |
 Twenty-Two New Approximate Proof Labeling Schemes (Full Version)International Symposium on Distributed Computing (DISC), 2020 |
 Local Certification of Graphs with Bounded GenusDiscrete Applied Mathematics (Discrete Appl. Math.), 2020 |
 Distributed Quantum Proofs for Replicated DataInformation Technology Convergence and Services (ITCS), 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 |
 |
 |
 |
