Back to the list of the institutes
Publications
Lorenzo Clemente
Number of publications: 242023
- David Barozzini, Lorenzo Clemente , Thomas Colcombet, Paweł Parys , Cost Automata, Safe Schemes, and Downward Closures, Fundamenta Informaticae, 188 (3) 2023, p. 127-178. See in PBN
- Nikhil Balaji, Lorenzo Clemente , Klara Nosan, Mahsa Shirmohammadi, James Worrell, Multiplicity Problems on Algebraic Series and Context-Free Grammars, Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, the United States of America, 26 June 2023 - 29 June 2023. See in PBN
- Lorenzo Clemente , Maria Donten-Bury , Filip Mazowiecki, Michał Pilipczuk , On Rational Recursive Sequences, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 March 2023 - 9 March 2023. See in PBN
2022
- Lorenzo Clemente , Sławomir Lasota , Radosław Piórkowski, Determinisability of register and timed automata, Logical Methods in Computer Science, 18 (2) 2022, p. 9:1–9:37. See in PBN
2021
- Barloy, Corentin, Lorenzo Clemente , Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 16 March 2021 - 19 March 2021. See in PBN
- Lorenzo Clemente , Michał Skrzypczak , Deterministic and Game Separability for Regular Languages of Infinite Trees, 48th International Colloquium on Automata, Languages and Programming, Glasgow, the United Kingdom of Great Britain and Northern Ireland, 12 July 2021 - 16 July 2021, 198 2021, p. 126:1--126:15. See in PBN
- Sławomir Lasota , Lorenzo Clemente , Reachability relations of timed pushdown automata, Journal of Computer and System Sciences, 117 2021, p. 202-241. See in PBN
2020
- David Barozzini, Lorenzo Clemente , Thomas Colcombet, Paweł Parys , Cost Automata, Safe Schemes, and Downward Closures, 47th International Colloquium on Automata, Languages and Programming, Saarbrücken, Germany, 8 July 2020 - 11 July 2020, 168 2020, p. 109:1-109:18. See in PBN
- Lorenzo Clemente , Sławomir Lasota , Radosław Piórkowski, Determinisability of One-Clock Timed Automata, 31st International Conference on Concurrency Theory, Vienna, Austria, 1 September 2020 - 4 September 2020. See in PBN
- Lorenzo Clemente , On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars, Electronic Proceedings in Theoretical Computer Science, 320 2020, p. 29-43. See in PBN
- Lorenzo Clemente , Sławomir Lasota , Radosław Piórkowski, Timed Games and Deterministic Separability, 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN
2019
- Lorenzo Clemente , Sławomir Lasota , Ranko Lazić, Filip Mazowiecki, Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems, ACM Transactions on Computational Logic, 20 (3) 2019, p. 1-31. See in PBN
- Lorenzo Clemente , Richard Mayr, Efficient reduction of nondeterministic automata with application to language inclusion testing, Logical Methods in Computer Science, 15 (1) 2019, p. 12:1–12:73. See in PBN
- Lorenzo Clemente , Piotr Hofman , Patrick Totzke, Timed Basic Parallel Processes, 30th International Conference on Concurrency Theory, Amsterdam, the Netherlands, 26 August 2019 - 31 August 2019. See in PBN
2018
- Sławomir Lasota , Lorenzo Clemente , Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July, 2018. See in PBN
2017
- Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. See in PBN
- Charles Paperman, Sławomir Lasota , Wojciech Czerwiński , Lorenzo Clemente , Regular Separability of Parikh Automata, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 July 2017 - 14 July 2017. See in PBN
- Sławomir Lasota , Charles Paperman, Wojciech Czerwiński , Lorenzo Clemente , Separability of Reachability Sets of Vector Addition Systems, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 March 2017 - 11 March 2017. See in PBN
- Lorenzo Clemente , Sławomir Lasota , Ranko Lazić, Filip Mazowiecki, Timed pushdown automata and branching vector addition systems, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 June 2017 - 23 June 2017. See in PBN
2016
- Ocan Sankur, Mathieu Sassolas, Guillermo A. P\'erez, Mickael Randour, Romain Brenguier, Paul Hunter, Jean-Franćcois Raskin, Lorenzo Clemente , Non-Zero Sum Games for Reactive Synthesis, International Conference on Language and Automata Theory and Applications, 2016. See in PBN
- Paweł Parys , Sylvain Salvati, Igor Walukiewicz, Lorenzo Clemente , The Diagonal Problem for Higher-Order Recursion Schemes is Decidable, 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, the United States of America, 5 July 2016 - 8 July 2016. See in PBN
2015
- Jean-Francois Raskin, Lorenzo Clemente , Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives, 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, 2015. See in PBN
- Igor Walukiewicz, Paweł Parys , Sylvain Salvati, Lorenzo Clemente , Ordered Tree-Pushdown Systems, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), Bangalore, India, 16 December 2015 - 18 December 2015. See in PBN
2014
- Sven Sandberg, Richard Mayr, Parosh Aziz Abdulla, Lorenzo Clemente , Stochastic Parity Games on Lossy Channel Systems, Logical Methods in Computer Science, 2014. See in PBN