Marcin Piatkowski

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 27

Top Topics

Coloured Petri Nets

Top Venues

ATAED@Petri Nets/ACSD

PNSE @ Petri Nets

Publications

Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297 (2024)
Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi
String inference from longest-common-prefix array. Theor. Comput. Sci. 942 (2023)
Kamila Barylska, Anna Gogolinska, Lukasz Mikulski, Anna Philippou, Marcin Piatkowski, Kyriaki Psara
Formal Translation from Reversing Petri Nets to Coloured Petri Nets. CoRR (2023)
Kamila Barylska, Anna Gogolinska, Lukasz Mikulski, Anna Philippou, Marcin Piatkowski, Kyriaki Psara
Formal Translation from Reversing Petri Nets to Coloured Petri Nets. RC (2022)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM (2021)
Evgeny Erofeev, Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski
Generating all minimal petri net unsolvable binary words. Discret. Appl. Math. 274 (2020)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Indexing the Bijective BWT. CPM (2019)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Constructing the Bijective BWT. CoRR (2019)
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29 (2) (2018)
Kamila Barylska, Anna Gogolinska, Lukasz Mikulski, Anna Philippou, Marcin Piatkowski, Kyriaki Psara
Reversing Computations Modelled by Coloured Petri Nets. ATAED@Petri Nets/ACSD (2018)
Kamila Barylska, Evgeny Erofeev, Maciej Koutny, Lukasz Mikulski, Marcin Piatkowski
Reversing Transitions in Bounded Petri Nets. Fundam. Informaticae 157 (4) (2018)
Kamila Barylska, Maciej Koutny, Lukasz Mikulski, Marcin Piatkowski
Reversible computation vs. reversibility in Petri nets. Sci. Comput. Program. 151 (2018)
Anna Gogolinska, Lukasz Mikulski, Marcin Piatkowski
GPU Computations and Memory Access Model Based on Petri Nets. Trans. Petri Nets Other Model. Concurr. 13 (2018)
Anna Gogolinska, Lukasz Mikulski, Marcin Piatkowski
GPU Computations and Memory Access Model Based on Petri Nets. PNSE @ Petri Nets (2017)
Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi
String Inference from Longest-Common-Prefix Array. ICALP (2017)
Lukasz Mikulski, Andrey Mokhov, Marcin Piatkowski
Reduction of Order Structures. ACSD (2017)
Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski, Maciej Koutny, Evgeny Erofeev
Reversing Transitions in Bounded Petri Nets. CS&P (2016)
Evgeny Erofeev, Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski
Generating All Minimal Petri Net Unsolvable Binary Words. Stringology (2016)
Kamila Barylska, Maciej Koutny, Lukasz Mikulski, Marcin Piatkowski
Reversible Computation vs. Reversibility in Petri Nets. RC (2016)
Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski
Conditions for Petri Net Solvable Binary Words. Trans. Petri Nets Other Model. Concurr. 11 (2016)
Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski
Tighter bounds for the sum of irreducible LCP values. Theor. Comput. Sci. 656 (2016)
Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi
String Inference from the LCP Array. CoRR (2016)
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
Diverse Palindromic Factorization Is NP-complete. DLT (2015)
Lukasz Mikulski, Marcin Piatkowski, Wojciech Rytter
Square-Free Words over Partially Commutative Alphabets. LATA (2015)
Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
Diverse Palindromic Factorization is NP-Complete. CoRR (2015)
Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski
On Binary Words Being Petri Net Solvable. ATAED@Petri Nets/ACSD (2015)
Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski
Tighter Bounds for the Sum of Irreducible LCP Values. CPM (2015)
Lukasz Mikulski, Artur Niewiadomski, Marcin Piatkowski, Sebastian Smyczynski
Generating CA-Plans from Multisets of Services. PNSE @ Petri Nets (2014)
Marcin Piatkowski, Wojciech Rytter
Computing the number of cubic runs in standard Sturmian words. Discret. Appl. Math. 163 (2014)
Lukasz Mikulski, Artur Niewiadomski, Marcin Piatkowski, Sebastian Smyczynski
On Generation of Context-Abstract Plans. SEFM Workshops (2014)
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
The Maximal Number of Runs in Standard Sturmian Words. Electron. J. Comb. 20 (1) (2013)
Lukasz Mikulski, Marcin Piatkowski, Sebastian Smyczynski
Lexicographical Generations of Combined Traces. ACSD (2013)
Marcin Piatkowski
The Sum of Exponents of Maximal Repetitions in Standard Sturmian Words. Stringology (2013)
Lukasz Mikulski, Marcin Piatkowski, Sebastian Smyczynski
Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended). Sci. Ann. Comput. Sci. 23 (2) (2013)
Marcin Piatkowski, Wojciech Rytter
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Int. J. Found. Comput. Sci. 23 (2) (2012)
Marcin Piatkowski, Wojciech Rytter
The Number of Cubes in Sturmian Words. Stringology (2012)
Lukasz Mikulski, Marcin Piatkowski, Sebastian Smyczynski
Algorithmics of Posets Generated by Words over Partially Commutative Alphabets. Stringology (2011)
Marcin Piatkowski, Wojciech Rytter
Computing the Number of Cubic Runs in Standard Sturmian Words. Stringology (2011)
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Int. J. Found. Comput. Sci. 20 (6) (2009)
Marcin Piatkowski, Wojciech Rytter
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Stringology (2009)
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
The Number of Runs in Sturmian Words. CIAA (2008)
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Stringology (2008)