Остановите войну!
for scientists:
default search action
Piotr Hofman
- > Home > Persons > Piotr Hofman
Publications
- 2023
- [c28]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Orbit-finite linear programming. LICS 2023: 1-14 - [i21]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Orbit-finite linear programming. CoRR abs/2302.00802 (2023) - 2022
- [c26]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Solvability of orbit-finite systems of linear equations. LICS 2022: 11:1-11:13 - [i19]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Solvability of orbit-finite systems of linear equations. CoRR abs/2201.09060 (2022) - 2021
- [j7]Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski:
A lower bound for the coverability problem in acyclic pushdown VAS. Inf. Process. Lett. 167: 106079 (2021) - [c25]Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan:
Parikh's theorem for infinite alphabets. LICS 2021: 1-13 - [i17]Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan:
Parikh's theorem for infinite alphabets. CoRR abs/2104.12018 (2021) - 2018
- [c20]Piotr Hofman, Slawomir Lasota:
Linear Equations with Ordered Data. CONCUR 2018: 24:1-24:17 - [i11]Piotr Hofman, Slawomir Lasota:
Linear Equations with Ordered Data. CoRR abs/1802.06660 (2018) - 2016
- [j4]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. 12(1) (2016) - [j3]Diego Figueira, Piotr Hofman, Slawomir Lasota:
Relating timed and register automata. Math. Struct. Comput. Sci. 26(6): 993-1021 (2016) - [c15]Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke:
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS 2016: 445-461 - 2014
- [j2]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Theory Comput. Syst. 55(1): 136-169 (2014) - 2013
- [j1]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. Log. Methods Comput. Sci. 9(3) (2013) - [c6]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS 2013: 515-526 - [i1]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. CoRR abs/1310.6303 (2013) - 2012
- [c4]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. CONCUR 2012: 53-68 - 2011
- [c2]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR 2011: 528-542 - 2010
- [c1]Diego Figueira, Piotr Hofman, Slawomir Lasota:
Relating timed and register automata. EXPRESS 2010: 61-75
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-07 03:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint