default search action
Marcin Piatkowski
Person information
- affiliation: Marcin Piątkowski
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl
, Marcin Piatkowski:
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297: 105153 (2024) - 2023
- [j13]Juha Kärkkäinen, Marcin Piatkowski
String inference from longest-common-prefix array. Theor. Comput. Sci. 942: 180-199 (2023) - [i4]Kamila Barylska, Anna Gogolinska, Lukasz Mikulski
Formal Translation from Reversing Petri Nets to Coloured Petri Nets. CoRR abs/2311.00629 (2023) - 2022
- [c24]Kamila Barylska, Anna Gogolinska, Lukasz Mikulski
Formal Translation from Reversing Petri Nets to Coloured Petri Nets. RC 2022: 172-186 - 2021
- [c23]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM 2021: 7:1-7:16 - 2020
- [j12]Evgeny Erofeev, Kamila Barylska
Generating all minimal petri net unsolvable binary words. Discret. Appl. Math. 274: 35-53 (2020)
2010 – 2019
- 2019
- [c22]Hideo Bannai
Indexing the Bijective BWT. CPM 2019: 17:1-17:14 - [i3]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Constructing the Bijective BWT. CoRR abs/1911.06985 (2019) - 2018
- [j11]Kamila Barylska
Reversing Transitions in Bounded Petri Nets. Fundam. Informaticae 157(4): 341-357 (2018) - [j10]Hideo Bannai, Travis Gagie
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29(2): 143-164 (2018) - [j9]Kamila Barylska
Reversible computation vs. reversibility in Petri nets. Sci. Comput. Program. 151: 48-60 (2018) - [j8]Anna Gogolinska, Lukasz Mikulski
GPU Computations and Memory Access Model Based on Petri Nets. Trans. Petri Nets Other Model. Concurr. 13: 136-157 (2018) - [c21]Kamila Barylska, Anna Gogolinska, Lukasz Mikulski, Anna Philippou, Marcin Piatkowski, Kyriaki Psara:
Reversing Computations Modelled by Coloured Petri Nets. ATAED@Petri Nets/ACSD 2018: 91-111 - 2017
- [c20]Lukasz Mikulski
Reduction of Order Structures. ACSD 2017: 96-105 - [c19]Anna Gogolinska, Lukasz Mikulski, Marcin Piatkowski:
GPU Computations and Memory Access Model Based on Petri Nets. PNSE @ Petri Nets 2017: 105-122 - [c18]Juha Kärkkäinen, Marcin Piatkowski
String Inference from Longest-Common-Prefix Array. ICALP 2017: 62:1-62:14 - 2016
- [j7]Juha Kärkkäinen, Dominik Kempa
Tighter bounds for the sum of irreducible LCP values. Theor. Comput. Sci. 656: 265-278 (2016) - [j6]Kamila Barylska
Conditions for Petri Net Solvable Binary Words. Trans. Petri Nets Other Model. Concurr. 11: 137-159 (2016) - [c17]Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski, Maciej Koutny, Evgeny Erofeev:
Reversing Transitions in Bounded Petri Nets. CS&P 2016: 74-85 - [c16]Kamila Barylska
Reversible Computation vs. Reversibility in Petri Nets. RC 2016: 105-118 - [c15]Evgeny Erofeev, Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski:
Generating All Minimal Petri Net Unsolvable Binary Words. Stringology 2016: 33-46 - [i2]Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi:
String Inference from the LCP Array. CoRR abs/1606.04573 (2016) - 2015
- [c14]Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski:
On Binary Words Being Petri Net Solvable. ATAED@Petri Nets/ACSD 2015: 1-15 - [c13]Juha Kärkkäinen, Dominik Kempa
Tighter Bounds for the Sum of Irreducible LCP Values. CPM 2015: 316-328 - [c12]Hideo Bannai, Travis Gagie
Diverse Palindromic Factorization Is NP-complete. DLT 2015: 85-96 - [c11]Lukasz Mikulski
Square-Free Words over Partially Commutative Alphabets. LATA 2015: 424-435 - [i1]Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. CoRR abs/1503.04045 (2015) - 2014
- [j5]Marcin Piatkowski
Computing the number of cubic runs in standard Sturmian words. Discret. Appl. Math. 163: 361-372 (2014) - [c10]Lukasz Mikulski, Artur Niewiadomski, Marcin Piatkowski, Sebastian Smyczynski:
Generating CA-Plans from Multisets of Services. PNSE @ Petri Nets 2014: 347-348 - [c9]Lukasz Mikulski
On Generation of Context-Abstract Plans. SEFM Workshops 2014: 376-388 - 2013
- [j4]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
The Maximal Number of Runs in Standard Sturmian Words. Electron. J. Comb. 20(1): 13 (2013) - [j3]Lukasz Mikulski
Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended). Sci. Ann. Comput. Sci. 23(2): 229-249 (2013) - [c8]Lukasz Mikulski
Lexicographical Generations of Combined Traces. ACSD 2013: 196-205 - [c7]Marcin Piatkowski:
The Sum of Exponents of Maximal Repetitions in Standard Sturmian Words. Stringology 2013: 48-62 - 2012
- [j2]Marcin Piatkowski
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Int. J. Found. Comput. Sci. 23(2): 303-321 (2012) - [c6]Marcin Piatkowski, Wojciech Rytter:
The Number of Cubes in Sturmian Words. Stringology 2012: 89-102 - 2011
- [c5]Marcin Piatkowski, Wojciech Rytter:
Computing the Number of Cubic Runs in Standard Sturmian Words. Stringology 2011: 106-120 - [c4]Lukasz Mikulski, Marcin Piatkowski, Sebastian Smyczynski:
Algorithmics of Posets Generated by Words over Partially Commutative Alphabets. Stringology 2011: 209-219
2000 – 2009
- 2009
- [j1]Pawel Baturo, Marcin Piatkowski
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Int. J. Found. Comput. Sci. 20(6): 1005-1023 (2009) - [c3]Marcin Piatkowski, Wojciech Rytter:
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Stringology 2009: 237-248 - 2008
- [c2]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Stringology 2008: 193-207 - [c1]Pawel Baturo, Marcin Piatkowski
The Number of Runs in Sturmian Words. CIAA 2008: 252-261
Coauthor Index
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 2025-03-04 22:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: