Piotr Hofman
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
26
Venues
8
Active years
2011–2026
Best venue rank
A*
Where they publish
Papers
26 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CAV | Weighted Soundness for Workflow Nets. | Piotr Hofman, Krzysztof Makuracki, Filip Mazowiecki |
| 2024 | LICS | Soundness of reset workflow nets. | Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt |
| 2023 | CAV | Fast Termination and Workflow Nets. | Piotr Hofman, Filip Mazowiecki, Philip Offtermatt |
| 2023 | LICS | Orbit-finite linear programming. | Arka Ghosh, Piotr Hofman, Slawomir Lasota |
| 2022 | CONCUR | Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. | Wojciech Czerwinski, Piotr Hofman |
| 2022 | LICS | Solvability of orbit-finite systems of linear equations. | Arka Ghosh, Piotr Hofman, Slawomir Lasota |
| 2021 | LICS | Parikh's theorem for infinite alphabets. | Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan |
| 2020 | CONCUR | Parametrized Universality Problems for One-Counter Nets. | Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke |
| 2020 | CONCUR | Universality Problem for Unambiguous VASS. | Wojciech Czerwinski, Diego Figueira, Piotr Hofman |
| 2019 | CONCUR | Timed Basic Parallel Processes. | Lorenzo Clemente, Piotr Hofman, Patrick Totzke |
| 2019 | FOSSACS | Continuous Reachability for Unordered Data Petri Nets is in PTime. | Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman |
| 2018 | CONCUR | Linear Equations with Ordered Data. | Piotr Hofman, Slawomir Lasota |
| 2018 | ICALP | Unboundedness Problems for Languages of Vector Addition Systems. | Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche |
| 2017 | FOSSACS | Bounding Average-Energy Games. | Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann |
| 2017 | LICS | Linear combinations of unordered data vectors. | Piotr Hofman, Jrme Leroux, Patrick Totzke |
| 2017 | STACS | On Bchi One-Counter Automata. | Stanislav Bhm, Stefan Gller, Simon Halfon, Piotr Hofman |
| 2016 | FOSSACS | Shortest Paths in One-Counter Systems. | Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar |
| 2016 | FOSSACS | Coverability Trees for Petri Nets with Unordered Data. | Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Sylvain Schmitz, Patrick Totzke |
| 2016 | LICS | The complexity of regular abstractions of one-counter languages. | Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche |
| 2016 | STACS | Tightening the Complexity of Equivalence Problems for Commutative Grammars. | Christoph Haase, Piotr Hofman |
| 2015 | ICDT | Separability by Short Subsequences and Subwords. | Piotr Hofman, Wim Martens |
| 2014 | CSL | Infinite-state energy games. | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke |
| 2014 | ICDT | Synthesizing transformations from XML schema mappings. | Claire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk |
| 2013 | LICS | Decidability of Weak Simulation on One-Counter Nets. | Piotr Hofman, Richard Mayr, Patrick Totzke |
| 2012 | CONCUR | Reachability Problem for Weak Multi-Pushdown Automata. | Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota |
| 2011 | CONCUR | Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. | Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota |