Marcin Piatkowski

Orcid: 0000-0001-5636-9497

Affiliations:
  • Marcin Piątkowski


According to our database1, Marcin Piatkowski authored at least 32 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Constructing and indexing the bijective and extended Burrows-Wheeler transform.
Inf. Comput., 2024

2023
String inference from longest-common-prefix array.
Theor. Comput. Sci., 2023

2022
Formal Translation from Reversing Petri Nets to Coloured Petri Nets.
Proceedings of the Reversible Computation - 14th International Conference, 2022

2021
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Generating all minimal petri net unsolvable binary words.
Discret. Appl. Math., 2020

2019
Constructing the Bijective BWT.
CoRR, 2019

Indexing the Bijective BWT.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
GPU Computations and Memory Access Model Based on Petri Nets.
Trans. Petri Nets Other Model. Concurr., 2018

Reversible computation vs. reversibility in Petri nets.
Sci. Comput. Program., 2018

Diverse Palindromic Factorization is NP-Complete.
Int. J. Found. Comput. Sci., 2018

Reversing Transitions in Bounded Petri Nets.
Fundam. Informaticae, 2018

Reversing Computations Modelled by Coloured Petri Nets.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2018 Satellite event of the conferences: 39th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2018 and 18th International Conference on Application of Concurrency to System Design ACSD 2018, 2018

2017
Reduction of Order Structures.
Proceedings of the 17th International Conference on Application of Concurrency to System Design, 2017

2016
Conditions for Petri Net Solvable Binary Words.
Trans. Petri Nets Other Model. Concurr., 2016

Tighter bounds for the sum of irreducible LCP values.
Theor. Comput. Sci., 2016

String Inference from the LCP Array.
CoRR, 2016

2015
Diverse Palindromic Factorization is NP-Complete.
CoRR, 2015

Square-Free Words over Partially Commutative Alphabets.
Proceedings of the Language and Automata Theory and Applications, 2015

Diverse Palindromic Factorization Is NP-complete.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

On Binary Words Being Petri Net Solvable.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, 2015

2014
Computing the number of cubic runs in standard Sturmian words.
Discret. Appl. Math., 2014

On Generation of Context-Abstract Plans.
Proceedings of the Software Engineering and Formal Methods, 2014

Generating CA-Plans from Multisets of Services.
Proceedings of the International Workshop on Petri Nets and Software Engineering, 2014

2013
Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended).
Sci. Ann. Comput. Sci., 2013

The Maximal Number of Runs in Standard Sturmian Words.
Electron. J. Comb., 2013

The Sum of Exponents of Maximal Repetitions in Standard Sturmian Words.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Lexicographical Generations of Combined Traces.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words.
Int. J. Found. Comput. Sci., 2012

The Number of Cubes in Sturmian Words.
Proceedings of the Prague Stringology Conference 2012, 2012

2011
Algorithmics of Posets Generated by Words over Partially Commutative Alphabets.
Proceedings of the Prague Stringology Conference 2011, 2011

2009
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words.
Int. J. Found. Comput. Sci., 2009

2008
The Number of Runs in Sturmian Words.
Proceedings of the Implementation and Applications of Automata, 2008


  Loading...