Marcin Piatkowski

Available identifiers

Publication	Date of Publication	Type
Constructing and indexing the bijective and extended Burrows-Wheeler transform	2024-03-27	Paper
https://portal.mardi4nfdi.de/entity/Q6098777	2023-06-14	Paper
String inference from longest-common-prefix array	2022-12-21	Paper
Formal translation from reversing Petri nets to coloured Petri nets	2022-11-11	Paper
Indexing the bijective BWT	2022-07-18	Paper
String Inference from Longest-Common-Prefix Array	2020-05-27	Paper
Generating all minimal Petri net unsolvable binary words	2020-02-14	Paper
Diverse Palindromic Factorization is NP-Complete	2018-05-15	Paper
Reversing Transitions in Bounded Petri Nets	2018-05-03	Paper
Conditions for Petri Net Solvable Binary Words	2017-06-20	Paper
Tighter bounds for the sum of irreducible LCP values	2017-02-06	Paper
Reversible Computation vs. Reversibility in Petri Nets	2016-08-10	Paper
Square-Free Words over Partially Commutative Alphabets	2016-04-08	Paper
Diverse Palindromic Factorization Is NP-complete	2015-11-10	Paper
Computing the number of cubic runs in standard Sturmian words	2015-09-22	Paper
Tighter Bounds for the Sum of Irreducible LCP Values	2015-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q5501011	2015-08-10	Paper
The maximal number of runs in standard Sturmian words	2013-06-07	Paper
Asymptotic behaviour of the maximal number of squares in standard Sturmian words	2012-08-30	Paper
Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words	2010-01-08	Paper
The Number of Runs in Sturmian Words	2009-02-12	Paper

This page was built for person: Marcin Piatkowski