• Submitted or to be submitted
    1. The monitoring problem for timed automata [arxiv]
    2. with Alejandro Grez, Michał Pilipczuk, Gabriele Puppis and Cristian Riveros.
    3. Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework [arxiv]
    4. with Floris Geerts and Guillermo A. Pérez.

    The published papers below are grouped by topics. See also my dblp.

  • Vector addition systems
    1. Reachability in fixed dimension vector addition systems with states [arxiv]
    2. with Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić and Jérôme Leroux, accepted to CONCUR 2020.
    3. Reachability for Bounded Branching VASS [arxiv]
    4. with Michał Pilipczuk, CONCUR 2019.
    5. The Reachability Problem for Petri Nets is Not Elementary [arxiv]
    6. with Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić and Jérôme Leroux, STOC 2019 (best paper award).
    7. Affine Extensions of Integer Vector Addition Systems with States [pdf]
    8. with Michael Blondin and Christoph Haase, CONCUR 2018.
    9. Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One [pdf]
    10. with Diego Figueira, Ranko Lazić, Jérôme Leroux and Grégoire Sutre, ICALP 2017.
    11. Timed pushdown automata and branching vector addition systems [pdf]
    12. with Lorenzo Clemente, Sławomir Lasota and Ranko Lazić, LICS 2017.
      The journal version is in ACM TOCL.

  • Weighted automata
    1. On polynomial recursive sequences [arxiv]
    2. with Michaël Cadilhac, Charles Paperman, Michał Pilipczuk and Géraud Sénizergues, ICALP 2020.
    3. A Robust Class of Linear Recurrence Sequences [arxiv]
    4. with Corentin Barloy, Nathanaël Fijalkow and Nathan Lhote, CSL 2020.
    5. Weak Cost Register Automata are Still Powerful [arxiv]
    6. with Shaull Almagor, Michaël Cadilhac and Guillermo A. Pérez, DLT 2018.
    7. When is Containment Decidable for Probabilistic Automata? [arxiv]
    8. with Laure Daviaud, Marcin Jurdziński, Ranko Lazić, Guillermo A. Pérez and James Worrell, ICALP 2018.
    9. Pumping lemmas for weighted automata [pdf]
    10. with Cristian Riveros, STACS 2018.
    11. Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties [pdf][arxiv]
    12. with Cristian Riveros, STACS 2016.
      The journal version is in JCSS.
    13. Maximal partition logic: towards a logical characterization of copyless cost register automata [pdf]
    14. with Cristian Riveros, CSL 2015.

  • Database related logics
    1. Eliminating recursion from monadic datalog programs on trees [arxiv]
    2. with Joanna Ochremiak and Adam Witkowski, MFCS 2015.
    3. Monadic Datalog and Regular Tree Pattern Queries [pdf]
    4. with Filip Murlak and Adam Witkowski, MFCS 2014.
      The journal version is in ACM TODS.
    5. Decidability of weak logics with deterministic transitive closure [pdf]
    6. with Witold Charatonik and Emanuel Kieroński, CSL-LICS 2014.
    7. Complexity of Two-Variable Logic on Finite Trees [pdf]
    8. with Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt and James Worrell, ICALP 2013.
      The journal version is in ACM TOCL.