default search action
Lorenzo Clemente
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c28]Lorenzo Clemente:
Weighted Basic Parallel Processes and Combinatorial Enumeration. CONCUR 2024: 18:1-18:22 - [i28]Lorenzo Clemente:
Weighted basic parallel processes and combinatorial enumeration. CoRR abs/2407.03638 (2024) - 2023
- [c27]Nikhil Balaji
, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Multiplicity Problems on Algebraic Series and Context-Free Grammars. LICS 2023: 1-12 - [c26]Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk:
On Rational Recursive Sequences. STACS 2023: 24:1-24:21 - [i27]Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Multiplicity Problems on Algebraic Series and Context-Free Grammars. CoRR abs/2304.14145 (2023) - 2022
- [j6]David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
Cost Automata, Safe Schemes, and Downward Closures. Fundam. Informaticae 188(3): 127-178 (2022) - [j5]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of register and timed automata. Log. Methods Comput. Sci. 18(2) (2022) - [i26]Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk:
On Rational Recursive Sequences. CoRR abs/2210.01635 (2022) - 2021
- [j4]Lorenzo Clemente, Slawomir Lasota:
Reachability relations of timed pushdown automata. J. Comput. Syst. Sci. 117: 202-241 (2021) - [c25]Lorenzo Clemente, Michal Skrzypczak:
Deterministic and Game Separability for Regular Languages of Infinite Trees. ICALP 2021: 126:1-126:15 - [c24]Corentin Barloy
Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. STACS 2021: 8:1-8:15 - [i25]Corentin Barloy, Lorenzo Clemente:
Bidimensional linear recursive sequences and universality of unambiguous register automata. CoRR abs/2101.01033 (2021) - [i24]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of register and timed automata. CoRR abs/2104.03690 (2021) - [i23]Lorenzo Clemente, Michal Skrzypczak:
Deterministic and game separability for regular languages of infinite trees. CoRR abs/2105.01137 (2021) - 2020
- [c23]Lorenzo Clemente
Determinisability of One-Clock Timed Automata. CONCUR 2020: 42:1-42:17 - [c22]David Barozzini, Lorenzo Clemente
Cost Automata, Safe Schemes, and Downward Closures. ICALP 2020: 109:1-109:18 - [c21]Lorenzo Clemente
Timed Games and Deterministic Separability. ICALP 2020: 121:1-121:16 - [c20]Lorenzo Clemente:
On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars. VPT/HCVS@ETAPS 2020: 29-43 - [i22]David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys:
Cost Automata, Safe Schemes, and Downward Closures. CoRR abs/2004.12187 (2020) - [i21]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Timed games and deterministic separability. CoRR abs/2004.12868 (2020) - [i20]Lorenzo Clemente:
On the complexity of the universality and inclusion problems for unambiguous context-free grammars (technical report). CoRR abs/2006.05275 (2020) - [i19]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of one-clock timed automata. CoRR abs/2007.09340 (2020) - [i18]Lorenzo Clemente, Slawomir Lasota:
Reachability relations of timed pushdown automata. CoRR abs/2012.15291 (2020)
2010 – 2019
- 2019
- [j3]Lorenzo Clemente, Richard Mayr:
Efficient reduction of nondeterministic automata with application to language inclusion testing. Log. Methods Comput. Sci. 15(1) (2019) - [j2]Lorenzo Clemente
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. ACM Trans. Comput. Log. 20(3): 14:1-14:31 (2019) - [c19]Lorenzo Clemente
Timed Basic Parallel Processes. CONCUR 2019: 15:1-15:16 - [i17]Lorenzo Clemente, Piotr Hofman, Patrick Totzke:
Timed Basic Parallel Processes. CoRR abs/1907.01240 (2019) - 2018
- [c18]Lorenzo Clemente, Slawomir Lasota
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. ICALP 2018: 118:1-118:14 - [i16]Lorenzo Clemente:
Decidability of Timed Communicating Automata. CoRR abs/1804.07815 (2018) - [i15]Lorenzo Clemente, Slawomir Lasota:
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms. CoRR abs/1804.10772 (2018) - 2017
- [c17]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota
Regular Separability of Parikh Automata. ICALP 2017: 117:1-117:13 - [c16]Lorenzo Clemente, Slawomir Lasota
Timed pushdown automata and branching vector addition systems. LICS 2017: 1-12 - [c15]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota
Separability of Reachability Sets of Vector Addition Systems. STACS 2017: 24:1-24:14 - [i14]Lorenzo Clemente, Richard Mayr:
Efficient reduction of nondeterministic automata with application to language inclusion testing. CoRR abs/1711.09946 (2017) - 2016
- [c14]Romain Brenguier, Lorenzo Clemente, Paul Hunter
Non-Zero Sum Games for Reactive Synthesis. LATA 2016: 3-23 - [c13]Lorenzo Clemente, Pawel Parys
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS 2016: 96-105 - [i13]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. CoRR abs/1605.00371 (2016) - [i12]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Separability of Reachability Sets of Vector Addition Systems. CoRR abs/1609.00214 (2016) - [i11]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Regular Separability of Parikh Automata. CoRR abs/1612.06233 (2016) - 2015
- [c12]Lorenzo Clemente, Slawomir Lasota
Reachability Analysis of First-order Definable Pushdown Systems. CSL 2015: 244-259 - [c11]Lorenzo Clemente, Pawel Parys
Ordered Tree-Pushdown Systems. FSTTCS 2015: 163-177 - [c10]Lorenzo Clemente, Jean-François Raskin
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. LICS 2015: 257-268 - [c9]Lorenzo Clemente, Slawomir Lasota
Timed Pushdown Automata Revisited. LICS 2015: 738-749 - [i10]Lorenzo Clemente, Slawomir Lasota:
Timed pushdown automata revisited. CoRR abs/1503.02422 (2015) - [i9]Lorenzo Clemente, Slawomir Lasota:
Reachability analysis of first-order definable pushdown systems. CoRR abs/1504.02651 (2015) - [i8]Lorenzo Clemente, Jean-François Raskin:
Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives. CoRR abs/1504.08211 (2015) - [i7]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. CoRR abs/1510.03278 (2015) - [i6]Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. CoRR abs/1512.05568 (2015) - 2014
- [j1]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. Log. Methods Comput. Sci. 10(4) (2014) - [c8]Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre:
Decidable Topologies for Communicating Automata with FIFO and Bag Channels. CONCUR 2014: 281-296 - [e1]Lukás Holík
Proceedings 15th International Workshop on Verification of Infinite-State Systems, INFINITY 2013, Hanoi, Vietnam, 14th October 2013. EPTCS 140, 2014 [contents] - [i5]Lorenzo Clemente:
Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting. CoRR abs/1410.4065 (2014) - 2013
- [c7]Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre:
Reachability of Communicating Timed Processes. FoSSaCS 2013: 81-96 - [c6]Richard Mayr, Lorenzo Clemente:
Advanced automata minimization. POPL 2013: 63-74 - [c5]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. QEST 2013: 338-354 - [i4]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. CoRR abs/1305.5228 (2013) - 2012
- [b1]Lorenzo Clemente:
Generalized simulation relations with applications in automata theory. University of Edinburgh, UK, 2012 - [i3]Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre:
Reachability of Communicating Timed Processes. CoRR abs/1209.0571 (2012) - [i2]Lorenzo Clemente, Richard Mayr:
Advanced Automata Minimization. CoRR abs/1210.6624 (2012) - 2011
- [c4]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR 2011: 187-202 - [c3]Lorenzo Clemente:
Büchi Automata Can Have Smaller Quotients. ICALP (2) 2011: 258-270 - [i1]Lorenzo Clemente:
Büchi Automata can have Smaller Quotients. CoRR abs/1102.3285 (2011) - 2010
- [c2]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV 2010: 132-147 - [c1]Lorenzo Clemente, Richard Mayr:
Multipebble Simulations for Alternating Automata - (Extended Abstract). CONCUR 2010: 297-312
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 01:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: