Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Lorenzo Clemente
@inproceedings{DBLP:conf/lics/BalajiCNS023,
author = {Nikhil Balaji and
Lorenzo Clemente and
Klara Nosan and
Mahsa Shirmohammadi and
James Worrell},
title = {Multiplicity Problems on Algebraic Series and Context-Free Grammars},
booktitle = {{LICS}},
pages = {1--12},
year = {2023},
url = {https://doi.org/10.1109/LICS56636.2023.10175707},
doi = {10.1109/LICS56636.2023.10175707},
timestamp = {Thu, 20 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/BalajiCNS023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ClementeDMP23,
author = {Lorenzo Clemente and
Maria Donten{-}Bury and
Filip Mazowiecki and
Michal Pilipczuk},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {On Rational Recursive Sequences},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {24:1--24:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.24},
doi = {10.4230/LIPICS.STACS.2023.24},
timestamp = {Fri, 03 Mar 2023 12:10:30 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ClementeDMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-14145,
author = {Nikhil Balaji and
Lorenzo Clemente and
Klara Nosan and
Mahsa Shirmohammadi and
James Worrell},
title = {Multiplicity Problems on Algebraic Series and Context-Free Grammars},
journal = {CoRR},
volume = {abs/2304.14145},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.14145},
doi = {10.48550/ARXIV.2304.14145},
eprinttype = {arXiv},
eprint = {2304.14145},
timestamp = {Wed, 03 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-14145.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/BarozziniCCP22,
author = {David Barozzini and
Lorenzo Clemente and
Thomas Colcombet and
Pawel Parys},
title = {Cost Automata, Safe Schemes, and Downward Closures},
journal = {Fundam. Informaticae},
volume = {188},
number = {3},
pages = {127--178},
year = {2022},
url = {https://doi.org/10.3233/FI-222145},
doi = {10.3233/FI-222145},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/BarozziniCCP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/ClementeLP22,
author = {Lorenzo Clemente and
Slawomir Lasota and
Radoslaw Pi{\'{o}}rkowski},
title = {Determinisability of register and timed automata},
journal = {Log. Methods Comput. Sci.},
volume = {18},
number = {2},
year = {2022},
url = {https://doi.org/10.46298/lmcs-18(2:9)2022},
doi = {10.46298/LMCS-18(2:9)2022},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/ClementeLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-01635,
author = {Lorenzo Clemente and
Maria Donten{-}Bury and
Filip Mazowiecki and
Michal Pilipczuk},
title = {On Rational Recursive Sequences},
journal = {CoRR},
volume = {abs/2210.01635},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.01635},
doi = {10.48550/ARXIV.2210.01635},
eprinttype = {arXiv},
eprint = {2210.01635},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-01635.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ClementeL21,
author = {Lorenzo Clemente and
Slawomir Lasota},
title = {Reachability relations of timed pushdown automata},
journal = {J. Comput. Syst. Sci.},
volume = {117},
pages = {202--241},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2020.11.003},
doi = {10.1016/J.JCSS.2020.11.003},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ClementeL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ClementeS21,
author = {Lorenzo Clemente and
Michal Skrzypczak},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Deterministic and Game Separability for Regular Languages of Infinite
Trees},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {126:1--126:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.126},
doi = {10.4230/LIPICS.ICALP.2021.126},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/ClementeS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BarloyC21,
author = {Corentin Barloy and
Lorenzo Clemente},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {Bidimensional Linear Recursive Sequences and Universality of Unambiguous
Register Automata},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {8:1--8:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.8},
doi = {10.4230/LIPICS.STACS.2021.8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BarloyC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-01033,
author = {Corentin Barloy and
Lorenzo Clemente},
title = {Bidimensional linear recursive sequences and universality of unambiguous
register automata},
journal = {CoRR},
volume = {abs/2101.01033},
year = {2021},
url = {https://arxiv.org/abs/2101.01033},
eprinttype = {arXiv},
eprint = {2101.01033},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-01033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-03690,
author = {Lorenzo Clemente and
Slawomir Lasota and
Radoslaw Pi{\'{o}}rkowski},
title = {Determinisability of register and timed automata},
journal = {CoRR},
volume = {abs/2104.03690},
year = {2021},
url = {https://arxiv.org/abs/2104.03690},
eprinttype = {arXiv},
eprint = {2104.03690},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-03690.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-01137,
author = {Lorenzo Clemente and
Michal Skrzypczak},
title = {Deterministic and game separability for regular languages of infinite
trees},
journal = {CoRR},
volume = {abs/2105.01137},
year = {2021},
url = {https://arxiv.org/abs/2105.01137},
eprinttype = {arXiv},
eprint = {2105.01137},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-01137.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Clemente0P20,
author = {Lorenzo Clemente and
Slawomir Lasota and
Radoslaw Pi{\'{o}}rkowski},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Determinisability of One-Clock Timed Automata},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {42:1--42:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.42},
doi = {10.4230/LIPICS.CONCUR.2020.42},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Clemente0P20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BarozziniCCP20,
author = {David Barozzini and
Lorenzo Clemente and
Thomas Colcombet and
Pawel Parys},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Cost Automata, Safe Schemes, and Downward Closures},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {109:1--109:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.109},
doi = {10.4230/LIPICS.ICALP.2020.109},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BarozziniCCP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Clemente0P20,
author = {Lorenzo Clemente and
Slawomir Lasota and
Radoslaw Pi{\'{o}}rkowski},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Timed Games and Deterministic Separability},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {121:1--121:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.121},
doi = {10.4230/LIPICS.ICALP.2020.121},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Clemente0P20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-2008-04667,
author = {Lorenzo Clemente},
editor = {Laurent Fribourg and
Matthias Heizmann},
title = {On the Complexity of the Universality and Inclusion Problems for Unambiguous
Context-Free Grammars},
booktitle = {Proceedings 8th International Workshop on Verification and Program
Transformation and 7th Workshop on Horn Clauses for Verification and
Synthesis, VPT/HCVS@ETAPS 2020, Dublin, Ireland, 25-26th April 2020},
series = {{EPTCS}},
volume = {320},
pages = {29--43},
year = {2020},
url = {https://doi.org/10.4204/EPTCS.320.2},
doi = {10.4204/EPTCS.320.2},
timestamp = {Mon, 26 Apr 2021 11:43:53 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-04667.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-12187,
author = {David Barozzini and
Lorenzo Clemente and
Thomas Colcombet and
Pawel Parys},
title = {Cost Automata, Safe Schemes, and Downward Closures},
journal = {CoRR},
volume = {abs/2004.12187},
year = {2020},
url = {https://arxiv.org/abs/2004.12187},
eprinttype = {arXiv},
eprint = {2004.12187},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-12187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-12868,
author = {Lorenzo Clemente and
Slawomir Lasota and
Radoslaw Pi{\'{o}}rkowski},
title = {Timed games and deterministic separability},
journal = {CoRR},
volume = {abs/2004.12868},
year = {2020},
url = {https://arxiv.org/abs/2004.12868},
eprinttype = {arXiv},
eprint = {2004.12868},
timestamp = {Wed, 29 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-12868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-05275,
author = {Lorenzo Clemente},
title = {On the complexity of the universality and inclusion problems for unambiguous
context-free grammars (technical report)},
journal = {CoRR},
volume = {abs/2006.05275},
year = {2020},
url = {https://arxiv.org/abs/2006.05275},
eprinttype = {arXiv},
eprint = {2006.05275},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-05275.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-09340,
author = {Lorenzo Clemente and
Slawomir Lasota and
Radoslaw Pi{\'{o}}rkowski},
title = {Determinisability of one-clock timed automata},
journal = {CoRR},
volume = {abs/2007.09340},
year = {2020},
url = {https://arxiv.org/abs/2007.09340},
eprinttype = {arXiv},
eprint = {2007.09340},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-09340.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-15291,
author = {Lorenzo Clemente and
Slawomir Lasota},
title = {Reachability relations of timed pushdown automata},
journal = {CoRR},
volume = {abs/2012.15291},
year = {2020},
url = {https://arxiv.org/abs/2012.15291},
eprinttype = {arXiv},
eprint = {2012.15291},
timestamp = {Fri, 08 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-15291.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/ClementeM19,
author = {Lorenzo Clemente and
Richard Mayr},
title = {Efficient reduction of nondeterministic automata with application
to language inclusion testing},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {1},
year = {2019},
url = {https://doi.org/10.23638/LMCS-15(1:12)2019},
doi = {10.23638/LMCS-15(1:12)2019},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/ClementeM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/ClementeLLM19,
author = {Lorenzo Clemente and
Slawomir Lasota and
Ranko Lazic and
Filip Mazowiecki},
title = {Binary Reachability of Timed-register Pushdown Automata and Branching
Vector Addition Systems},
journal = {{ACM} Trans. Comput. Log.},
volume = {20},
number = {3},
pages = {14:1--14:31},
year = {2019},
url = {https://doi.org/10.1145/3326161},
doi = {10.1145/3326161},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/ClementeLLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/ClementeHT19,
author = {Lorenzo Clemente and
Piotr Hofman and
Patrick Totzke},
editor = {Wan J. Fokkink and
Rob van Glabbeek},
title = {Timed Basic Parallel Processes},
booktitle = {30th International Conference on Concurrency Theory, {CONCUR} 2019,
August 27-30, 2019, Amsterdam, the Netherlands},
series = {LIPIcs},
volume = {140},
pages = {15:1--15:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.15},
doi = {10.4230/LIPICS.CONCUR.2019.15},
timestamp = {Mon, 18 May 2020 10:45:19 +0200},
biburl = {https://dblp.org/rec/conf/concur/ClementeHT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-01240,
author = {Lorenzo Clemente and
Piotr Hofman and
Patrick Totzke},
title = {Timed Basic Parallel Processes},
journal = {CoRR},
volume = {abs/1907.01240},
year = {2019},
url = {http://arxiv.org/abs/1907.01240},
eprinttype = {arXiv},
eprint = {1907.01240},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-01240.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ClementeL18,
author = {Lorenzo Clemente and
Slawomir Lasota},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Binary Reachability of Timed Pushdown Automata via Quantifier Elimination
and Cyclic Order Atoms},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {118:1--118:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.118},
doi = {10.4230/LIPICS.ICALP.2018.118},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/ClementeL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07815,
author = {Lorenzo Clemente},
title = {Decidability of Timed Communicating Automata},
journal = {CoRR},
volume = {abs/1804.07815},
year = {2018},
url = {http://arxiv.org/abs/1804.07815},
eprinttype = {arXiv},
eprint = {1804.07815},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07815.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-10772,
author = {Lorenzo Clemente and
Slawomir Lasota},
title = {Binary reachability of timed pushdown automata via quantifier elimination
and cyclic order atoms},
journal = {CoRR},
volume = {abs/1804.10772},
year = {2018},
url = {http://arxiv.org/abs/1804.10772},
eprinttype = {arXiv},
eprint = {1804.10772},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-10772.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ClementeCLP17,
author = {Lorenzo Clemente and
Wojciech Czerwinski and
Slawomir Lasota and
Charles Paperman},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Regular Separability of Parikh Automata},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {117:1--117:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.117},
doi = {10.4230/LIPICS.ICALP.2017.117},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ClementeCLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ClementeLLM17,
author = {Lorenzo Clemente and
Slawomir Lasota and
Ranko Lazic and
Filip Mazowiecki},
title = {Timed pushdown automata and branching vector addition systems},
booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2017, Reykjavik, Iceland, June 20-23, 2017},
pages = {1--12},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/LICS.2017.8005083},
doi = {10.1109/LICS.2017.8005083},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ClementeLLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ClementeCLP17,
author = {Lorenzo Clemente and
Wojciech Czerwinski and
Slawomir Lasota and
Charles Paperman},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {Separability of Reachability Sets of Vector Addition Systems},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {24:1--24:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.24},
doi = {10.4230/LIPICS.STACS.2017.24},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ClementeCLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-09946,
author = {Lorenzo Clemente and
Richard Mayr},
title = {Efficient reduction of nondeterministic automata with application
to language inclusion testing},
journal = {CoRR},
volume = {abs/1711.09946},
year = {2017},
url = {http://arxiv.org/abs/1711.09946},
eprinttype = {arXiv},
eprint = {1711.09946},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-09946.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BrenguierCHPRRS16,
author = {Romain Brenguier and
Lorenzo Clemente and
Paul Hunter and
Guillermo A. P{\'{e}}rez and
Mickael Randour and
Jean{-}Fran{\c{c}}ois Raskin and
Ocan Sankur and
Mathieu Sassolas},
editor = {Adrian{-}Horia Dediu and
Jan Janousek and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Non-Zero Sum Games for Reactive Synthesis},
booktitle = {Language and Automata Theory and Applications - 10th International
Conference, {LATA} 2016, Prague, Czech Republic, March 14-18, 2016,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9618},
pages = {3--23},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30000-9\_1},
doi = {10.1007/978-3-319-30000-9\_1},
timestamp = {Thu, 08 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/BrenguierCHPRRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ClementePSW16,
author = {Lorenzo Clemente and
Pawel Parys and
Sylvain Salvati and
Igor Walukiewicz},
editor = {Martin Grohe and
Eric Koskinen and
Natarajan Shankar},
title = {The Diagonal Problem for Higher-Order Recursion Schemes is Decidable},
booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer
Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
pages = {96--105},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933575.2934527},
doi = {10.1145/2933575.2934527},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/ClementePSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementePSW16,
author = {Lorenzo Clemente and
Pawel Parys and
Sylvain Salvati and
Igor Walukiewicz},
title = {The Diagonal Problem for Higher-Order Recursion Schemes is Decidable},
journal = {CoRR},
volume = {abs/1605.00371},
year = {2016},
url = {http://arxiv.org/abs/1605.00371},
eprinttype = {arXiv},
eprint = {1605.00371},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ClementePSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementeCLP16,
author = {Lorenzo Clemente and
Wojciech Czerwinski and
Slawomir Lasota and
Charles Paperman},
title = {Separability of Reachability Sets of Vector Addition Systems},
journal = {CoRR},
volume = {abs/1609.00214},
year = {2016},
url = {http://arxiv.org/abs/1609.00214},
eprinttype = {arXiv},
eprint = {1609.00214},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ClementeCLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementeCLP16a,
author = {Lorenzo Clemente and
Wojciech Czerwinski and
Slawomir Lasota and
Charles Paperman},
title = {Regular Separability of Parikh Automata},
journal = {CoRR},
volume = {abs/1612.06233},
year = {2016},
url = {http://arxiv.org/abs/1612.06233},
eprinttype = {arXiv},
eprint = {1612.06233},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ClementeCLP16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/ClementeL15,
author = {Lorenzo Clemente and
Slawomir Lasota},
editor = {Stephan Kreutzer},
title = {Reachability Analysis of First-order Definable Pushdown Systems},
booktitle = {24th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2015,
September 7-10, 2015, Berlin, Germany},
series = {LIPIcs},
volume = {41},
pages = {244--259},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.CSL.2015.244},
doi = {10.4230/LIPICS.CSL.2015.244},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/csl/ClementeL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ClementePSW15,
author = {Lorenzo Clemente and
Pawel Parys and
Sylvain Salvati and
Igor Walukiewicz},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {Ordered Tree-Pushdown Systems},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {163--177},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.163},
doi = {10.4230/LIPICS.FSTTCS.2015.163},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ClementePSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ClementeR15,
author = {Lorenzo Clemente and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff
Objectives},
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2015, Kyoto, Japan, July 6-10, 2015},
pages = {257--268},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/LICS.2015.33},
doi = {10.1109/LICS.2015.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ClementeR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ClementeL15,
author = {Lorenzo Clemente and
Slawomir Lasota},
title = {Timed Pushdown Automata Revisited},
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2015, Kyoto, Japan, July 6-10, 2015},
pages = {738--749},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/LICS.2015.73},
doi = {10.1109/LICS.2015.73},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ClementeL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementeL15,
author = {Lorenzo Clemente and
Slawomir Lasota},
title = {Timed pushdown automata revisited},
journal = {CoRR},
volume = {abs/1503.02422},
year = {2015},
url = {http://arxiv.org/abs/1503.02422},
eprinttype = {arXiv},
eprint = {1503.02422},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ClementeL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementeL15a,
author = {Lorenzo Clemente and
Slawomir Lasota},
title = {Reachability analysis of first-order definable pushdown systems},
journal = {CoRR},
volume = {abs/1504.02651},
year = {2015},
url = {http://arxiv.org/abs/1504.02651},
eprinttype = {arXiv},
eprint = {1504.02651},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ClementeL15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementeR15,
author = {Lorenzo Clemente and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Multidimensional beyond worst-case and almost-sure problems for mean-payoff
objectives},
journal = {CoRR},
volume = {abs/1504.08211},
year = {2015},
url = {http://arxiv.org/abs/1504.08211},
eprinttype = {arXiv},
eprint = {1504.08211},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ClementeR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementePSW15,
author = {Lorenzo Clemente and
Pawel Parys and
Sylvain Salvati and
Igor Walukiewicz},
title = {Ordered Tree-Pushdown Systems},
journal = {CoRR},
volume = {abs/1510.03278},
year = {2015},
url = {http://arxiv.org/abs/1510.03278},
eprinttype = {arXiv},
eprint = {1510.03278},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ClementePSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrenguierCHPRRS15,
author = {Romain Brenguier and
Lorenzo Clemente and
Paul Hunter and
Guillermo A. P{\'{e}}rez and
Mickael Randour and
Jean{-}Fran{\c{c}}ois Raskin and
Ocan Sankur and
Mathieu Sassolas},
title = {Non-Zero Sum Games for Reactive Synthesis},
journal = {CoRR},
volume = {abs/1512.05568},
year = {2015},
url = {http://arxiv.org/abs/1512.05568},
eprinttype = {arXiv},
eprint = {1512.05568},
timestamp = {Thu, 08 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrenguierCHPRRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbdullaCMS14,
author = {Parosh Aziz Abdulla and
Lorenzo Clemente and
Richard Mayr and
Sven Sandberg},
title = {Stochastic Parity Games on Lossy Channel Systems},
journal = {Log. Methods Comput. Sci.},
volume = {10},
number = {4},
year = {2014},
url = {https://doi.org/10.2168/LMCS-10(4:21)2014},
doi = {10.2168/LMCS-10(4:21)2014},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbdullaCMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/ClementeHS14,
author = {Lorenzo Clemente and
Fr{\'{e}}d{\'{e}}ric Herbreteau and
Gr{\'{e}}goire Sutre},
editor = {Paolo Baldan and
Daniele Gorla},
title = {Decidable Topologies for Communicating Automata with {FIFO} and Bag
Channels},
booktitle = {{CONCUR} 2014 - Concurrency Theory - 25th International Conference,
{CONCUR} 2014, Rome, Italy, September 2-5, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8704},
pages = {281--296},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44584-6\_20},
doi = {10.1007/978-3-662-44584-6\_20},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/concur/ClementeHS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:journals/corr/HolikC14,
editor = {Luk{\'{a}}s Hol{\'{\i}}k and
Lorenzo Clemente},
title = {Proceedings 15th International Workshop on Verification of Infinite-State
Systems, {INFINITY} 2013, Hanoi, Vietnam, 14th October 2013},
series = {{EPTCS}},
volume = {140},
year = {2014},
url = {https://doi.org/10.4204/EPTCS.140},
doi = {10.4204/EPTCS.140},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/HolikC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Clemente14,
author = {Lorenzo Clemente},
title = {Unified Analysis of Collapsible and Ordered Pushdown Automata via
Term Rewriting},
journal = {CoRR},
volume = {abs/1410.4065},
year = {2014},
url = {http://arxiv.org/abs/1410.4065},
eprinttype = {arXiv},
eprint = {1410.4065},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Clemente14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fossacs/ClementeHSS13,
author = {Lorenzo Clemente and
Fr{\'{e}}d{\'{e}}ric Herbreteau and
Am{\'{e}}lie Stainer and
Gr{\'{e}}goire Sutre},
editor = {Frank Pfenning},
title = {Reachability of Communicating Timed Processes},
booktitle = {Foundations of Software Science and Computation Structures - 16th
International Conference, {FOSSACS} 2013, Held as Part of the European
Joint Conferences on Theory and Practice of Software, {ETAPS} 2013,
Rome, Italy, March 16-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7794},
pages = {81--96},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-37075-5\_6},
doi = {10.1007/978-3-642-37075-5\_6},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/fossacs/ClementeHSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/MayrC13,
author = {Richard Mayr and
Lorenzo Clemente},
editor = {Roberto Giacobazzi and
Radhia Cousot},
title = {Advanced automata minimization},
booktitle = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
Programming Languages, {POPL} '13, Rome, Italy - January 23 - 25,
2013},
pages = {63--74},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2429069.2429079},
doi = {10.1145/2429069.2429079},
timestamp = {Thu, 24 Jun 2021 16:19:31 +0200},
biburl = {https://dblp.org/rec/conf/popl/MayrC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/qest/AbdullaCMS13,
author = {Parosh Aziz Abdulla and
Lorenzo Clemente and
Richard Mayr and
Sven Sandberg},
editor = {Kaustubh R. Joshi and
Markus Siegle and
Mari{\"{e}}lle Stoelinga and
Pedro R. D'Argenio},
title = {Stochastic Parity Games on Lossy Channel Systems},
booktitle = {Quantitative Evaluation of Systems - 10th International Conference,
{QEST} 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8054},
pages = {338--354},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40196-1\_29},
doi = {10.1007/978-3-642-40196-1\_29},
timestamp = {Sat, 30 Sep 2023 09:55:03 +0200},
biburl = {https://dblp.org/rec/conf/qest/AbdullaCMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-5228,
author = {Parosh Aziz Abdulla and
Lorenzo Clemente and
Richard Mayr and
Sven Sandberg},
title = {Stochastic Parity Games on Lossy Channel Systems},
journal = {CoRR},
volume = {abs/1305.5228},
year = {2013},
url = {http://arxiv.org/abs/1305.5228},
eprinttype = {arXiv},
eprint = {1305.5228},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-5228.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ethos/Clemente12,
author = {Lorenzo Clemente},
title = {Generalized simulation relations with applications in automata theory},
school = {University of Edinburgh, {UK}},
year = {2012},
url = {https://hdl.handle.net/1842/6215},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ethos/Clemente12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-0571,
author = {Lorenzo Clemente and
Fr{\'{e}}d{\'{e}}ric Herbreteau and
Am{\'{e}}lie Stainer and
Gr{\'{e}}goire Sutre},
title = {Reachability of Communicating Timed Processes},
journal = {CoRR},
volume = {abs/1209.0571},
year = {2012},
url = {http://arxiv.org/abs/1209.0571},
eprinttype = {arXiv},
eprint = {1209.0571},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-0571.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-6624,
author = {Lorenzo Clemente and
Richard Mayr},
title = {Advanced Automata Minimization},
journal = {CoRR},
volume = {abs/1210.6624},
year = {2012},
url = {http://arxiv.org/abs/1210.6624},
eprinttype = {arXiv},
eprint = {1210.6624},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-6624.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AbdullaCCHHMV11,
author = {Parosh Aziz Abdulla and
Yu{-}Fang Chen and
Lorenzo Clemente and
Luk{\'{a}}s Hol{\'{\i}}k and
Chih{-}Duo Hong and
Richard Mayr and
Tom{\'{a}}s Vojnar},
editor = {Joost{-}Pieter Katoen and
Barbara K{\"{o}}nig},
title = {Advanced Ramsey-Based B{\"{u}}chi Automata Inclusion Testing},
booktitle = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
{CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6901},
pages = {187--202},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23217-6\_13},
doi = {10.1007/978-3-642-23217-6\_13},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/AbdullaCCHHMV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Clemente11,
author = {Lorenzo Clemente},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {B{\"{u}}chi Automata Can Have Smaller Quotients},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6756},
pages = {258--270},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22012-8\_20},
doi = {10.1007/978-3-642-22012-8\_20},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Clemente11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-3285,
author = {Lorenzo Clemente},
title = {B{\"{u}}chi Automata can have Smaller Quotients},
journal = {CoRR},
volume = {abs/1102.3285},
year = {2011},
url = {http://arxiv.org/abs/1102.3285},
eprinttype = {arXiv},
eprint = {1102.3285},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-3285.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/AbdullaCCHHMV10,
author = {Parosh Aziz Abdulla and
Yu{-}Fang Chen and
Lorenzo Clemente and
Luk{\'{a}}s Hol{\'{\i}}k and
Chih{-}Duo Hong and
Richard Mayr and
Tom{\'{a}}s Vojnar},
editor = {Tayssir Touili and
Byron Cook and
Paul B. Jackson},
title = {Simulation Subsumption in Ramsey-Based B{\"{u}}chi Automata Universality
and Inclusion Testing},
booktitle = {Computer Aided Verification, 22nd International Conference, {CAV}
2010, Edinburgh, UK, July 15-19, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6174},
pages = {132--147},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14295-6\_14},
doi = {10.1007/978-3-642-14295-6\_14},
timestamp = {Thu, 21 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cav/AbdullaCCHHMV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/ClementeM10,
author = {Lorenzo Clemente and
Richard Mayr},
editor = {Paul Gastin and
Fran{\c{c}}ois Laroussinie},
title = {Multipebble Simulations for Alternating Automata - (Extended Abstract)},
booktitle = {{CONCUR} 2010 - Concurrency Theory, 21th International Conference,
{CONCUR} 2010, Paris, France, August 31-September 3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6269},
pages = {297--312},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15375-4\_21},
doi = {10.1007/978-3-642-15375-4\_21},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/concur/ClementeM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:48 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:
