Piotrek Hofman

Cited by

	All	Since 2017
Citations	311	188
h-index	11	8
i10-index	13	5

200920102011201220132014201520162017201820192020202120221 2 6 10 9 31 20 38 34 30 34 36 35 19

Public access

View all

13 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Slawomir LasotaUniversity of Warsaw, prof. of computer scienceVerified email at mimuw.edu.pl
Patrick TotzkeUniversity of LiverpoolVerified email at liverpool.ac.uk
Wojciech CzerwinskiUniversity of WarsawVerified email at mimuw.edu.pl
Jerome LerouxCNRS researcher, LaBRI, FranceVerified email at labri.fr
Narayan KumarProfessor, Chennai Mathematical InstituteVerified email at cmi.ac.in
Diego FigueiraCNRS, LaBRI, Univ. BordeauxVerified email at labri.fr
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Mohamed Faouzi AtigUppsala UniversityVerified email at it.uu.se
Ranko LazicDepartment of Computer Science, University of WarwickVerified email at warwick.ac.uk
Parosh AbdullaProfessor of Computer Science, Uppsala UniversityVerified email at it.uu.se
Georg ZetzscheMPI-SWS, GermanyVerified email at mpi-sws.org
Wim MartensUniversity of BayreuthVerified email at uni-bayreuth.de
Sylvain SchmitzUniversité Paris CitéVerified email at irif.fr
Christoph HaaseUniversity of OxfordVerified email at cs.ox.ac.uk
Prakash SaivasanInstitute of Mathematical SciencesVerified email at imsc.res.in
Martin ZimmermannAalborg UniversityVerified email at cs.aau.dk
Mickael RandourFNRS & UMONSVerified email at umons.ac.be
Patricia BouyerLMF, Université Paris-Saclay, CNRS, ENS Paris-SaclayVerified email at lsv.fr
Nicolas MarkeyCNRS, IRISA, Univ. Rennes, FranceVerified email at irisa.fr
Serge HaddadProfessor of Computer Science, ENS Paris-SaclayVerified email at lsv.fr

Piotrek Hofman

University of Warsaw

Verified email at mimuw.edu.pl - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Relating timed and register automata D Figueira, P Hofman, S Lasota Mathematical Structures in Computer Science 26 (6), 993-1021, 2016	41	2016
Separability by short subsequences and subwords P Hofman, W Martens 18th International Conference on Database Theory (ICDT 2015), 2015	25	2015
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	23	2011
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	22	2016
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	20	2014
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	17	2016
Reachability problem for weak multi-pushdown automata W Czerwiński, P Hofman, S Lasota International Conference on Concurrency Theory, 53-68, 2012	15	2012
Trace inclusion for one-counter nets revisited P Hofman, P Totzke International Workshop on Reachability Problems, 151-162, 2014	13	2014
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	13	2013
Simulation problems over one-counter nets P Totzke, R Mayr, S Lasota, P Hofman Logical Methods in Computer Science 12, 2016	11	2016
Tightening the complexity of equivalence problems for commutative grammars C Haase, P Hofman arXiv preprint arXiv:1506.07774, 2015	11	2015
Linear equations with ordered data P Hofman, S Lasota arXiv preprint arXiv:1802.06660, 2018	10	2018
The complexity of regular abstractions of one-counter languages MF Atig, D Chistikov, P Hofman, KN Kumar, P Saivasan, G Zetzsche 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016	10	2016
Bounding average-energy games P Bouyer, P Hofman, N Markey, M Randour, M Zimmermann International Conference on Foundations of Software Science and Computation …, 2017	9	2017
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	8	2017
Simulation over one-counter nets is PSPACE-complete P Hofman, S Lasota, R Mayr, P Totzke arXiv preprint arXiv:1310.6303, 2013	8	2013
On Büchi one-counter automata S Böhm, S Göller, S Halfon, P Hofman 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017	7	2017
Parikh’s theorem for infinite alphabets P Hofman, M Juzepczuk, S Lasota, M Pattathurajan 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021	5	2021
Universality problem for unambiguous VASS W Czerwiński, D Figueira, P Hofman arXiv preprint arXiv:2007.10907, 2020	5	2020
Trace inclusion for one-counter nets revisited P Hofman, P Totzke Theoretical Computer Science 735, 50-63, 2018	5	2018

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors