Marcin Piatkowski

From MaRDI portal
Person:496557

Available identifiers

zbMath Open piatkowski.marcinMaRDI QIDQ496557

List of research outcomes





PublicationDate of PublicationType
Constructing and indexing the bijective and extended Burrows-Wheeler transform2024-03-27Paper
https://portal.mardi4nfdi.de/entity/Q60987772023-06-14Paper
String inference from longest-common-prefix array2022-12-21Paper
Formal translation from reversing Petri nets to coloured Petri nets2022-11-11Paper
Indexing the bijective BWT2022-07-18Paper
String Inference from Longest-Common-Prefix Array2020-05-27Paper
Generating all minimal Petri net unsolvable binary words2020-02-14Paper
Diverse Palindromic Factorization is NP-Complete2018-05-15Paper
Reversing Transitions in Bounded Petri Nets2018-05-03Paper
Conditions for Petri Net Solvable Binary Words2017-06-20Paper
Tighter bounds for the sum of irreducible LCP values2017-02-06Paper
Reversible Computation vs. Reversibility in Petri Nets2016-08-10Paper
Square-Free Words over Partially Commutative Alphabets2016-04-08Paper
Diverse Palindromic Factorization Is NP-complete2015-11-10Paper
Computing the number of cubic runs in standard Sturmian words2015-09-22Paper
Tighter Bounds for the Sum of Irreducible LCP Values2015-08-20Paper
https://portal.mardi4nfdi.de/entity/Q55010112015-08-10Paper
The maximal number of runs in standard Sturmian words2013-06-07Paper
Asymptotic behaviour of the maximal number of squares in standard Sturmian words2012-08-30Paper
Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words2010-01-08Paper
The Number of Runs in Sturmian Words2009-02-12Paper

Research outcomes over time

This page was built for person: Marcin Piatkowski