Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. - Parosh Aziz Abdulla; Yu-Fang Chen 001; Lorenzo Clemente; Lukás Holík; Chih-Duo Hong; Richard Mayr; Tomás Vojnar (CAV, 2010)

Multipebble Simulations for Alternating Automata - (Extended Abstract). - Lorenzo Clemente; Richard Mayr (CONCUR, 2010)

Advanced Ramsey-Based Büchi Automata Inclusion Testing. - Parosh Aziz Abdulla; Yu-Fang Chen 001; Lorenzo Clemente; Lukás Holík; Chih-Duo Hong; Richard Mayr; Tomás Vojnar (CONCUR, 2011)

Büchi Automata Can Have Smaller Quotients. - Lorenzo Clemente (ICALP (2), 2011)

Generalized simulation relations with applications in automata theory. - Lorenzo Clemente (2012)

Reachability of Communicating Timed Processes. - Lorenzo Clemente; Frédéric Herbreteau; Amélie Stainer; Grégoire Sutre (FoSSaCS, 2013)

Advanced automata minimization. - Richard Mayr; Lorenzo Clemente (POPL, 2013)

Decidable Topologies for Communicating Automata with FIFO and Bag Channels. - Lorenzo Clemente; Frédéric Herbreteau; Grégoire Sutre (CONCUR, 2014)

Stochastic Parity Games on Lossy Channel Systems. - Parosh Aziz Abdulla; Lorenzo Clemente; Richard Mayr; Sven Sandberg (Log. Methods Comput. Sci., 2014)

Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting. - Lorenzo Clemente (CoRR, 2014)

Reachability Analysis of First-order Definable Pushdown Systems. - Lorenzo Clemente; Slawomir Lasota 001 (CSL, 2015)

Ordered Tree-Pushdown Systems. - Lorenzo Clemente; Pawel Parys; Sylvain Salvati; Igor Walukiewicz (FSTTCS, 2015)

Timed Pushdown Automata Revisited. - Lorenzo Clemente; Slawomir Lasota 001 (LICS, 2015)

Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. - Lorenzo Clemente; Jean-François Raskin (LICS, 2015)

Non-Zero Sum Games for Reactive Synthesis. - Romain Brenguier; Lorenzo Clemente; Paul Hunter 001; Guillermo A. Pérez 001; Mickael Randour; Jean-François Raskin; Ocan Sankur; Mathieu Sassolas (LATA, 2016)

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. - Lorenzo Clemente; Pawel Parys; Sylvain Salvati; Igor Walukiewicz (LICS, 2016)

Regular Separability of Parikh Automata. - Lorenzo Clemente; Wojciech Czerwinski; Slawomir Lasota 001; Charles Paperman (ICALP, 2017)

Timed pushdown automata and branching vector addition systems. - Lorenzo Clemente; Slawomir Lasota 001; Ranko Lazic 001; Filip Mazowiecki (LICS, 2017)

Separability of Reachability Sets of Vector Addition Systems. - Lorenzo Clemente; Wojciech Czerwinski; Slawomir Lasota 001; Charles Paperman (STACS, 2017)

Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. - Lorenzo Clemente; Slawomir Lasota 001 (ICALP, 2018)

Decidability of Timed Communicating Automata. - Lorenzo Clemente (CoRR, 2018)

Timed Basic Parallel Processes. - Lorenzo Clemente; Piotr Hofman; Patrick Totzke (CONCUR, 2019)

Efficient reduction of nondeterministic automata with application to language inclusion testing. - Lorenzo Clemente; Richard Mayr (Log. Methods Comput. Sci., 2019)

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. - Lorenzo Clemente; Slawomir Lasota 001; Ranko Lazic 001; Filip Mazowiecki (ACM Trans. Comput. Log., 2019)

Determinisability of One-Clock Timed Automata. - Lorenzo Clemente; Slawomir Lasota 001; Radoslaw Piórkowski (CONCUR, 2020)

Timed Games and Deterministic Separability. - Lorenzo Clemente; Slawomir Lasota 001; Radoslaw Piórkowski (ICALP, 2020)

On the complexity of the universality and inclusion problems for unambiguous context-free grammars (technical report). - Lorenzo Clemente (CoRR, 2020)

On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars. - Lorenzo Clemente (VPT/HCVS@ETAPS, 2020)

Deterministic and Game Separability for Regular Languages of Infinite Trees. - Lorenzo Clemente; Michal Skrzypczak (ICALP, 2021)

Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. - Corentin Barloy; Lorenzo Clemente (STACS, 2021)

Reachability relations of timed pushdown automata. - Lorenzo Clemente; Slawomir Lasota 001 (J. Comput. Syst. Sci., 2021)

Cost Automata, Safe Schemes, and Downward Closures. - David Barozzini; Lorenzo Clemente; Thomas Colcombet; Pawel Parys (Fundam. Informaticae, 2022)

Determinisability of register and timed automata. - Lorenzo Clemente; Slawomir Lasota 001; Radoslaw Piórkowski (Log. Methods Comput. Sci., 2022)

Multiplicity Problems on Algebraic Series and Context-Free Grammars. - Nikhil Balaji; Lorenzo Clemente; Klara Nosan; Mahsa Shirmohammadi; James Worrell 001 (LICS, 2023)

On Rational Recursive Sequences. - Lorenzo Clemente; Maria Donten-Bury; Filip Mazowiecki; Michal Pilipczuk (STACS, 2023)

Weighted Basic Parallel Processes and Combinatorial Enumeration. - Lorenzo Clemente (CONCUR, 2024)

The commutativity problem for effective varieties of formal series, and applications. - Lorenzo Clemente (CoRR, 2025)

Algorithmic analysis of systems with affine input and polynomial state. - Lorenzo Clemente (CoRR, 2025)