| ||
| 1. | Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE Tom 23 Nr 2 r. 2012, str. 303-321 (Artykuł) Marcin Piatkowski, Wojciech Rytter | |
| 2. | Efficient algorithms for three variants of the LPF table
JOURNAL OF DISCRETE ALGORITHMS Tom 11 r. 2012, str. 51-61 (Artykuł) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń | |
| 3. | On the maximal sum of exponents of runs in a string
JOURNAL OF DISCRETE ALGORITHMS Tom 14 r. 2012, str. 29-36 (Artykuł) Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 4. | On the structure of compacted subword graphs of Thue-Morse words and their applications
JOURNAL OF DISCRETE ALGORITHMS Tom 11 r. 2012, str. 15-24 (Artykuł) Jakub Radoszewski, Wojciech Rytter | |
| 5. | The maximal number of cubic runs in a word
JOURNAL OF COMPUTER AND SYSTEM SCIENCES Tom 78 Nr 6 r. 2012, str. 1828-1836 (Artykuł) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 6. | Efficient Seeds Computation Revisited
LECTURE NOTES IN COMPUTER SCIENCE Tom 6661 r. 2011, str. 350-363 (Artykuł konferencyjny) Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Waleń | |
| 7. | Hamiltonian Paths in the Square of a Tree
LECTURE NOTES IN COMPUTER SCIENCE Tom 7074 r. 2011, str. 90-99 (Artykuł konferencyjny) Jakub Radoszewski, Wojciech Rytter | |
| 8. | Polynomial-Time Approximation Algorithms for Weighted LCS Problem
LECTURE NOTES IN COMPUTER SCIENCE Tom 6661 r. 2011, str. 455-466 (Artykuł konferencyjny) Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 9. | Algorithms for Three Versions of the Shortest Common Superstring Problem
LECTURE NOTES IN COMPUTER SCIENCE Tom 6129 r. 2010, str. 299-309 (Artykuł) Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 10. | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
LECTURE NOTES IN COMPUTER SCIENCE Tom 5901 r. 2010, str. 296-307 (Artykuł) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń | |
| 11. | Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup
LECTURE NOTES IN COMPUTER SCIENCE Tom 5901 r. 2010, str. 663-671 (Artykuł) Jakub Radoszewski, Wojciech Rytter | |
| 12. | Extracting Powers and Periods in a String from Its Runs Structure
LECTURE NOTES IN COMPUTER SCIENCE Tom 6393 r. 2010, str. 258-269 (Artykuł) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 13. | On the Maximal Number of Cubic Runs in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 6031 r. 2010, str. 227-238 (Artykuł) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 14. | On the Maximal Sum of Exponents of Runs in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 6460 r. 2010, str. 10-19 (Artykuł konferencyjny) Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 15. | Post Correspondence Problem with Partially Commutative Alphabets
LECTURE NOTES IN COMPUTER SCIENCE Tom 6031 r. 2010, str. 356-367 (Artykuł) Barbara Klunder, Wojciech Rytter | |
| 16. | Tiling Periodicity
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE Tom 12 Nr 2 r. 2010, str. 237-248 (Artykuł) Juhani Karhumäki, Yury Lifshits, Wojciech Rytter | |
| 17. | Compressed string-matching in standard Sturmian words
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 30-32 r. 2009, str. 2804-2810 (Artykuł) Paweł Baturo, Wojciech Rytter | |
| 18. | Improved methods for extracting frequent itemsets from interim-support trees
SOFTWARE-PRACTICE & EXPERIENCE Tom 39 Nr 6 r. 2009, str. 551-571 (Artykuł) Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou | |
| 19. | LPF Computation Revisited
LECTURE NOTES IN COMPUTER SCIENCE Tom 5874 r. 2009, str. 158-169 (Artykuł) Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń | |
| 20. | On the Maximal Number of Cubic Subwords in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 5874 r. 2009, str. 345-355 (Artykuł) Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 21. | Repetitions in strings: Algorithms and combinatorics
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 50 r. 2009, str. 5227-5235 (Artykuł) Maxime Crochemore, Lucian Ilie, Wojciech Rytter | |
| 22. | Usefullness of directed acyclic graphs in problems related to standard Sturmian words
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE Tom 20 Nr 6 r. 2009, str. 1005-1023 (Artykuł) Marcin Piątkowski, Wojciech Rytter | |
| 23. | Matching Integer Intervals by Minimal Sets of Binary Words with don't cares
LECTURE NOTES IN COMPUTER SCIENCE Tom 5029 r. 2008, str. 217-229 (Artykuł) Wojciech Frączak, Wojciech Rytter, Mohammadreza Yazdani | |
| 24. | Efficient Computation of Throughput Values of Context-Free Languages
LECTURE NOTES IN COMPUTER SCIENCE Tom 4783 r. 2007, str. 203-213 (Artykuł konferencyjny) Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter | |
| 25. | Equivalence of simple functions
THEORETICAL COMPUTER SCIENCE Tom 376 Nr 1 r. 2007, str. 42-51 (Artykuł) Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter | |