Publikacje

Czasopismo: International Journal of Foundations of Computer Science

2024

• Mirosław Kowaluk , Andrzej Lingas, Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products, International Journal of Foundations of Computer Science, 35 (7) 2024, s. 871-886. Zobacz w PBN

2020

• Shaull Almagor, Michaël Cadilhac, Guillermo A. Pérez, Filip Mazowiecki , Weak Cost Register Automata are Still Powerful, International Journal of Foundations of Computer Science, 31 (6) 2020, s. 689-709. Zobacz w PBN

2018

• Henryk Michalewski , Michał Skrzypczak , On the Strength of Unambiguous Tree Automata, International Journal of Foundations of Computer Science, 29 (5) 2018, s. 911-933. Zobacz w PBN
• Michał Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Jakub Radoszewski , Palindromic Decompositions with Gaps and Errors, International Journal of Foundations of Computer Science, 29 (8) 2018, s. 1311–1329. Zobacz w PBN

2012

• Marcin Piatkowski, Wojciech Rytter , Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words, International Journal of Foundations of Computer Science, 2012. Zobacz w PBN

2011

• Markku Laine, Wojciech Plandowski , Word Equations with One Unknown, International Journal of Foundations of Computer Science, 2011. Zobacz w PBN

2009

• Marcin Piątkowski, Wojciech Rytter , Usefullness of directed acyclic graphs in problems related to standard Sturmian words, International Journal of Foundations of Computer Science, 2009. Zobacz w PBN

2005

• Costas Iliopoulos, James MCHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter , Marie-France Sagot, A first approach to finding common motifs with gaps, International Journal of Foundations of Computer Science, 2005. Zobacz w PBN