| 2026 | LICS | Commutative Algebras of Series. | Lorenzo Clemente |
| 2025 | LICS | The commutativity problem for effective varieties of formal series, and applications. | Lorenzo Clemente |
| 2024 | CONCUR | Weighted Basic Parallel Processes and Combinatorial Enumeration. | Lorenzo Clemente |
| 2023 | LICS | Multiplicity Problems on Algebraic Series and Context-Free Grammars. | Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell |
| 2023 | STACS | On Rational Recursive Sequences. | Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk |
| 2021 | ICALP | Deterministic and Game Separability for Regular Languages of Infinite Trees. | Lorenzo Clemente, Michal Skrzypczak |
| 2021 | STACS | Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. | Corentin Barloy, Lorenzo Clemente |
| 2020 | CONCUR | Determinisability of One-Clock Timed Automata. | Lorenzo Clemente, Slawomir Lasota, Radoslaw Pirkowski |
| 2020 | ICALP | Cost Automata, Safe Schemes, and Downward Closures. | David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys |
| 2020 | ICALP | Timed Games and Deterministic Separability. | Lorenzo Clemente, Slawomir Lasota, Radoslaw Pirkowski |
| 2019 | CONCUR | Timed Basic Parallel Processes. | Lorenzo Clemente, Piotr Hofman, Patrick Totzke |
| 2018 | ICALP | Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. | Lorenzo Clemente, Slawomir Lasota |
| 2017 | ICALP | Regular Separability of Parikh Automata. | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2017 | LICS | Timed pushdown automata and branching vector addition systems. | Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki |
| 2017 | STACS | Separability of Reachability Sets of Vector Addition Systems. | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2016 | LATA | Non-Zero Sum Games for Reactive Synthesis. | Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Prez, Mickael Randour, Jean-Franois Raskin, Ocan Sankur, Mathieu Sassolas |
| 2016 | LICS | The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. | Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz |
| 2015 | CSL | Reachability Analysis of First-order Definable Pushdown Systems. | Lorenzo Clemente, Slawomir Lasota |
| 2015 | LICS | Timed Pushdown Automata Revisited. | Lorenzo Clemente, Slawomir Lasota |
| 2015 | LICS | Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. | Lorenzo Clemente, Jean-Franois Raskin |
| 2014 | CONCUR | Decidable Topologies for Communicating Automata with FIFO and Bag Channels. | Lorenzo Clemente, Frdric Herbreteau, Grgoire Sutre |
| 2013 | FOSSACS | Reachability of Communicating Timed Processes. | Lorenzo Clemente, Frdric Herbreteau, Amlie Stainer, Grgoire Sutre |
| 2013 | POPL | Advanced automata minimization. | Richard Mayr, Lorenzo Clemente |
| 2011 | CONCUR | Advanced Ramsey-Based Bchi Automata Inclusion Testing. | Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Luks Holk, Chih-Duo Hong, Richard Mayr, Toms Vojnar |
| 2011 | ICALP | Bchi Automata Can Have Smaller Quotients. | Lorenzo Clemente |
| 2010 | CAV | Simulation Subsumption in Ramsey-Based Bchi Automata Universality and Inclusion Testing. | Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Luks Holk, Chih-Duo Hong, Richard Mayr, Toms Vojnar |
| 2010 | CONCUR | Multipebble Simulations for Alternating Automata - (Extended Abstract). | Lorenzo Clemente, Richard Mayr |