 The Distributed Complexity of Locally Checkable Labeling Problems Beyond
Paths and TreesInformation Technology Convergence and Services (ITCS), 2023 |
 On the Node-Averaged Complexity of Locally Checkable Problems on TreesInternational Symposium on Distributed Computing (DISC), 2023 |
 Efficient Classification of Locally Checkable Problems in Regular TreesInternational Symposium on Distributed Computing (DISC), 2022 |
 What can be certified compactly?ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 Nicolas Bousquet Laurent Feuilloley Théo Pierron |
 The Landscape of Distributed Complexities on Trees and BeyondACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Local Problems on Trees from the Perspectives of Distributed Algorithms,
Finitary Factors, and Descriptive CombinatoricsInformation Technology Convergence and Services (ITCS), 2021 |
 Locally Checkable Labelings with Small MessagesInternational Symposium on Distributed Computing (DISC), 2021 |
 Locally Checkable Problems in Rooted TreesDistributed computing (Distrib. Comput.), 2021 |
 Local MendingColloquium on Structural Information & Communication Complexity (SIROCCO), 2021 |
 The Complexity Landscape of Distributed Locally Checkable Problems on
TreesInternational Symposium on Distributed Computing (DISC), 2020 |
