Lorenzo Clemente

INVITED TALKS

LMW@LICS'25 (Singapore) What I want to hear during a scientific presentation [slides]

SAMSA Workshop 2025 (Warsaw) Formal analysis of polynomial control systems

INFINITY'23 (Antwerp) The equality problem in automata, combinatorics, and logic [slides]

VPT'20@VPT'21 (online) On the complexity of the universality and inclusion problems for unambiguous context-free grammars

AVeRTS'17 (Warsaw) Modelling time and recursion [slides]

INFINITY'17 (Reykjavik) Towards regular separability of Petri net languages [slides]

CONFERENCE and workshop PRESENTATIONS

HIGHLIGHTS'25 (Saarbrücken) TBA [slides]

LICS'25 (Singapore) The commutativity problem for effective varieties of formal series, and applications [slides]

HIGHLIGHTS'24 (Bordeaux) Zeroness of weighted basic parallel processes [slides]

CONCUR'24 (Calgary) Weighted basic parallel processes and combinatorial enumeration [slides]

HIGHLIGHTS'23 (Kassel) Complexity of equality of power series from combinatorial enumeration [slides]

LICS'23 (Boston) Multiplicity problems on algebraic series and context-free grammars [slides]

HIGHLIGHTS'18 (Berlin) Ternary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms

ICALP'18 (Prague), Ternary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms [slides]

INFINITY'18 (Prague), Decidability of Timed Communicating Automata [slides]

HIGHLIGHTS'17 (London), Regular separability of Parikh automata languages [slides]

LICS'16 (New York), The Diagonal Problem for Higher-Order Recursion Schemes is Decidable [slides]

FSTTCS'15 (Bengaluru), Ordered Tree-Pushdown Systems [slides]

HIGHLIGHTS'15 (Prague), Reachability analysis of first-order definable pushdown systems [slides]

CSL'15 (Berlin), Reachability analysis of first-order definable pushdown systems [slides]

LICS'15 (Kyoto), Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives [slides]

CONCUR'14 (Rome), Decidable Topologies for Communicating Automata with FIFO and Bag Channels [slides]

FOSSACS'13 (Rome), Reachability of communicating timed processes, March 2013

GAMES'11 (Paris), Efficient algebraic approaches to Büchi automata inclusion checking, September 2011

CONCUR'11 (Aachen), Advanced Ramsey-based Büchi automata inclusion test, September 2011

ICALP'11 (Zürich), Büchi Automata Can Have Smaller Quotients, July 2011

CONCUR'10 (Paris), Multipebble simulations preorders for alternating Büchi automata, September 2010

GAMES'09 (Udine), Multipebble simulation games for alternating automata

OTHER TALKS

ACPMS seminar (Algebraic and combinatorial perspectives in the mathematical sciences, online), TBA, September 2025 [slides]

Verification seminar (Computing Laboratory, University of Oxford), Weighted commutative grammars and combinatorial enumeration, November 2024 [slides]

Master automata seminar (MIMUW, University of Warsaw), Weighted basic parallel processes - equivalence and applications, October 2024 [slides]

Infinite Automata 2024 (Warlity Wielkie, Poland), Restivo-Reutenauer conjecture (open problems session), June 2024 [slides]

Infinite Automata 2024 (Warlity Wielkie, Poland), Theory of shuffle series (future research session), June 2024 [slides]

Master automata seminar (MIMUW, University of Warsaw), The equivalence problem in theoretical computer science, October 2023 [slides]

Automata seminar (MIMUW, University of Warsaw), Equality and zeroness problems of power series for combinatorial enumeration, April 2023 (blackboard presentation) [abstract]

Automata seminar (MIMUW, University of Warsaw), Decidability of equivalence of deterministic one-way multitape finite automata, December 2022 (blackboard presentation) [abstract]

Verification seminar (IRIF, Université de Paris), Zeroness and equality problems for weighted register automata over equality data, November 2022 (blackboard presentation)

Automata seminar (IRIF, Université de Paris), Bidimensional linear recursive sequences and universality of unambiguous register automata, October 2020 [slides]

Verification seminar (IRIF, Université de Paris), Determinisability & deterministic separability of timed automata, June 2020 [slides] [video]

Automata seminar, Overview of classical and recent decidability and complexity results for networks of timed communicating automata, October 2018

Master's seminar (Warsaw), Simplification of finite automata [slides], 2017

Computer science department (Leipzig), Un-timing the stack in Dense-timed Pushdown Automata, January 2015

Computer science department (Bath), A saturation-based approach to the verification of higher-order functional programs, February 2014

VACSIM meeting (Plouzané), Reachability of communicating timed processes, April 2013

Plume (Lyon), A saturation-based approach to the verification of higher-order functional programs, December 2013

LaBRI (Bordeaux), Optimizing Büchi automata universality and inclusion checking with subsumption preorders, January 2012

LaBRI (Bordeaux), Fixed-word simulations and ranks, February 2012

LaBRI (Bordeaux), Reachability of communicating timed processes, October 2012

IRISA/Inria (Rennes), Advanced automata minimization, October 2012

RTWH Aachen University, Advanced automata minimization, November 2012

Oxford Verification Group, Büchi automata can have smaller quotients, May 2011

BCTCS 2010 (Edinburgh), Multipebble simulation preorders for alternating Büchi automata, April 2010

Verification Group (Bruxelles), Multipebble simulations preorders for alternating Büchi automata, May 2010

Google Sites

Report abuse