Marcin Piatkowski

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Constructing and indexing the bijective and extended Burrows-Wheeler transform Information and Computation	2024-03-27	Paper
scientific article; zbMATH DE number 7695993 (Why is no real title available?) (available as arXiv preprint)	2023-06-14	Paper
String inference from longest-common-prefix array Theoretical Computer Science	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 (available as arXiv preprint)	2020-05-27	Paper
Generating all minimal Petri net unsolvable binary words Discrete Applied Mathematics	2020-02-14	Paper
Diverse Palindromic Factorization is NP-Complete International Journal of Foundations of Computer Science	2018-05-15	Paper
Reversing transitions in bounded Petri nets Fundamenta Informaticae	2018-05-03	Paper
Conditions for Petri net solvable binary words Transactions on Petri Nets and Other Models of Concurrency XI	2017-06-20	Paper
Tighter bounds for the sum of irreducible LCP values Theoretical Computer Science	2017-02-06	Paper
Reversible computation vs. reversibility in Petri nets Reversible Computation	2016-08-10	Paper
Square-free words over partially commutative alphabets Language and Automata Theory and Applications	2016-04-08	Paper
Diverse Palindromic Factorization Is NP-complete Developments in Language Theory	2015-11-10	Paper
Computing the number of cubic runs in standard Sturmian words Discrete Applied Mathematics	2015-09-22	Paper
Tighter bounds for the sum of irreducible LCP values Combinatorial Pattern Matching	2015-08-20	Paper
Visualisation of concurrent processes	2015-08-10	Paper
The maximal number of runs in standard Sturmian words The Electronic Journal of Combinatorics	2013-06-07	Paper
Asymptotic behaviour of the maximal number of squares in standard Sturmian words International Journal of Foundations of Computer Science	2012-08-30	Paper
Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words International Journal of Foundations of Computer Science	2010-01-08	Paper
The Number of Runs in Sturmian Words Implementation and Applications of Automata	2009-02-12	Paper

Research outcomes over time

This page was built for person: Marcin Piatkowski