( en | de | ru )

 

Disambiguation of "Piatkowski, Marcin"

Author of the publication

copydeleteadd this publication to your clipboard
Reversible computation vs. reversibility in Petri nets.

, , , and . Sci. Comput. Program., (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Wladislaus Piatkowski

Joachim Piatkowski

Bernhard Piatkowski

Uwe Piatkowski

Jutta Piatkowski

 

Other publications of authors with the same name

Computing the Number of Cubic Runs in Standard Sturmian Words., and . Stringology, page 106-120. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2011)String Inference from the LCP Array., , and . CoRR, (2016)Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words., and . Int. J. Found. Comput. Sci., 23 (2): 303-321 (2012)Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words., , and . Int. J. Found. Comput. Sci., 20 (6): 1005-1023 (2009)String Inference from Longest-Common-Prefix Array., , and . ICALP, volume 80 of LIPIcs, page 62:1-62:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Tighter bounds for the sum of irreducible LCP values., , and . Theor. Comput. Sci., (2016)Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time., , , and . CPM, volume 191 of LIPIcs, page 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Number of Cubes in Sturmian Words., and . Stringology, page 89-102. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2012)Generating All Minimal Petri Net Unsolvable Binary Words., , , and . Stringology, page 33-46. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)Reversing Transitions in Bounded Petri Nets., , , , and . Fundam. Informaticae, 157 (4): 341-357 (2018)