2019

Clemente, Lorenzo, Lasota, Sławomir, Lazic, Ranko and Mazowiecki, Filip (2019) Binary reachability of timed-register pushdown automata and branching vector addition systems. ACM Transactions on Computational Logic, 20 (3). pp. 1-31. 14. doi:10.1145/3326161

Czerwiński, Wojciech, Lasota, Sławomir, Lazic, Ranko, Leroux, Jerome and Mazowiecki, Filip (2019) The reachability problem for Petri nets is not elementary. In: STOC 2019, Phoenix, AZ, USA, 23-26 Jun 2019. Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing pp. 24-33. ISBN 9781450367059. doi:10.1145/3313276.3316369

2017

Figueira, Diego, Lazic, Ranko, Leroux, Jerome, Mazowiecki, Filip and Sutre, Grégoire (2017) Polynomial-space completeness of reachability for succinct branching VASS in dimension one. In: The 44th International Colloquium on Automata, Languages, and Programming (ICALP), Warsaw, Poland, 10-14 July 2017. Published in: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming doi:10.4230/LIPIcs.ICALP.2017.119 (In Press)

Clemente, Lorenzo, Lasota, Slawomir, Lazic, Ranko and Mazowiecki, Filip (2017) Timed pushdown automata and branching vector addition systems. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20-23 Jun 2017. Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ISBN 9781509030194. doi:10.1109/LICS.2017.8005083