| Relating timed and register automata D Figueira, P Hofman, S Lasota Mathematical Structures in Computer Science 26 (6), 993-1021, 2016 | 40 | 2016 |
| Coverability trees for Petri nets with unordered data P Hofman, S Lasota, R Lazić, J Leroux, S Schmitz, P Totzke International Conference on Foundations of Software Science and Computation …, 2016 | 32 | 2016 |
| Shortest paths in one-counter systems D Chistikov, W Czerwiński, P Hofman, M Pilipczuk, M Wehar International Conference on Foundations of Software Science and Computation …, 2016 | 27 | 2016 |
| Separability by short subsequences and subwords P Hofman, W Martens 18th International Conference on Database Theory (ICDT 2015), 230-246, 2015 | 26 | 2015 |
| Infinite-state energy games PA Abdulla, MF Atig, P Hofman, R Mayr, KN Kumar, P Totzke Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 24 | 2014 |
| Decidability of branching bisimulation on normed commutative context-free processes W Czerwiński, P Hofman, S Lasota International Conference on Concurrency Theory, 528-542, 2011 | 22 | 2011 |
| Decidability of weak simulation on one-counter nets P Hofman, R Mayr, P Totzke 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 203-212, 2013 | 21 | 2013 |
| Unboundedness problems for languages of vector addition systems P Hofman, G Zetzsche arXiv preprint arXiv:1802.06683, 2018 | 19 | 2018 |
| Linear combinations of unordered data vectors P Hofman, J Leroux, P Totzke 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-11, 2017 | 16 | 2017 |
| Simulation problems over one-counter nets P Hofman, S Lasota, R Mayr, P Totzke Logical Methods in Computer Science 12, 2016 | 16 | 2016 |
| Trace inclusion for one-counter nets revisited P Hofman, P Totzke International Workshop on Reachability Problems, 151-162, 2014 | 16 | 2014 |
| The complexity of regular abstractions of one-counter languages MF Atig, D Chistikov, P Hofman, KN Kumar, P Saivasan, G Zetzsche Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 15 | 2016 |
| A lower bound for the coverability problem in acyclic pushdown VAS M Englert, P Hofman, S Lasota, R Lazić, J Leroux, J Straszyński Information Processing Letters 167, 106079, 2021 | 14 | 2021 |
| Linear equations with ordered data P Hofman, S Lasota arXiv preprint arXiv:1802.06660, 2018 | 14 | 2018 |
| Bounding average-energy games P Bouyer, P Hofman, N Markey, M Randour, M Zimmermann International Conference on Foundations of Software Science and Computation …, 2017 | 14 | 2017 |
| Tightening the complexity of equivalence problems for commutative grammars C Haase, P Hofman arXiv preprint arXiv:1506.07774, 2015 | 14 | 2015 |
| Trace inclusion for one-counter nets revisited P Hofman, P Totzke Theoretical Computer Science 735, 50-63, 2018 | 12 | 2018 |
| Active diagnosis with observable quiescence S Böhm, S Haar, S Haddad, P Hofman, S Schwoon 2015 54th IEEE conference on decision and control (CDC), 1663-1668, 2015 | 12 | 2015 |
| Reachability problem for weak multi-pushdown automata W Czerwiński, P Hofman, S Lasota Logical Methods in Computer Science 9, 2013 | 12 | 2013 |
| Language inclusion for boundedly-ambiguous vector addition systems is decidable W Czerwiński, P Hofman Logical Methods in Computer Science 21, 2025 | 10 | 2025 |
Slawomir LasotaUniversity of Warsaw, prof. of computer scienceVerified email at mimuw.edu.pl
