| 2026 | CONCUR | Algebraic Characterization of FO-Definable Languages of Higher-Dimensional Automata. | Enzo Erlich, Jrmy Ledent, Krzysztof Ziemianski |
| 2026 | CSL | Kamp Theorem for Pomset Languages of Higher Dimensional Automata. | Emily Clement, Enzo Erlich, Jrmy Ledent |
| 2024 | CSL | A Many-Sorted Epistemic Logic for Chromatic Hypergraphs. | ric Goubault, Roman Kniazev, Jrmy Ledent |
| 2023 | LICS | Semi-Simplicial Set Models for Distributed Knowledge. | ric Goubault, Roman Kniazev, Jrmy Ledent, Sergio Rajsbaum |
| 2022 | STACS | A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die. | ric Goubault, Jrmy Ledent, Sergio Rajsbaum |
| 2021 | PODC | Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes. | Jrmy Ledent |
| 2019 | CONCUR | A Sound Foundation for the Topological Approach to Task Solvability. | Jrmy Ledent, Samuel Mimram |
| 2019 | TAP | A Dynamic Epistemic Logic Analysis of the Equality Negation Task. | ric Goubault, Marijana Lazic, Jrmy Ledent, Sergio Rajsbaum |
| 2018 | OPODIS | Concurrent Specifications Beyond Linearizability. | ric Goubault, Jrmy Ledent, Samuel Mimram |
| 2017 | LICS | A cartesian-closed category for higher-order model checking. | Martin Hofmann, Jrmy Ledent |