Publikacje

Wojciech Rytter

Liczba publikacji: 170

2024

• Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Approximate Circular Pattern Matching Under Edit Distance, 41st International Symposium on Theoretical Aspects of Computer Science, Clermont-Ferrand, France, 12 marca 2024 - 14 marca 2024. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words, 31st International Symposium on String Processing and Information Retrieval, Puerto Vallarta, Mexico, 23 września 2024 - 25 września 2024. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Internal Pattern Matching Queries in a Text and Applications, SIAM Journal on Computing, 53 (5) 2024, s. 1524-1577. Zobacz w PBN

2023

• Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String, 34th Annual Symposium on Combinatorial Pattern Matching, Marne-la-Vallée, France, 26 czerwca 2023 - 28 czerwca 2023. Zobacz w PBN

2022

• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , A periodicity lemma for partial words, Information and Computation, 283 2022, s. 104677. Zobacz w PBN
• Panagiotis Charalampopoulos, Kociumaka Tomasz, Jakub Radoszewski , Solon P. Pissis, Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Approximate Circular Pattern Matching, 30th Annual European Symposium on Algorithms, Poczdam, Germany, 5 września 2022 - 7 września 2022. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , WANDA ZUBA, Efficient representation and counting of antipower factors in words, Information and Computation, 286 2022, s. 104779: 1-18. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Linear-Time Computation of Shortest Covers of All Rotations of a String, 33rd Annual Symposium on Combinatorial Pattern Matching, Praga, Czechia, 27 czerwca 2022 - 29 czerwca 2022. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Rectangular Tile Covers of 2D-Strings, 33rd Annual Symposium on Combinatorial Pattern Matching, Praga, Czechia, 27 czerwca 2022 - 29 czerwca 2022. Zobacz w PBN
• Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Subsequence Covers of Words, 29th International Symposium on String Processing and Information Retrieval, Concepcion, Chile, 8 listopada 2022 - 10 listopada 2022, 13617 2022, s. 3--15. Zobacz w PBN

2021

• Tomasz Kociumaka, Solon P. Pissis, Wojciech Rytter , Tomasz Waleń , Jakub Radoszewski , Juliusz Straszyński , Wiktor Zuba, Panagiotis Charalampopoulos, Circular pattern matching with k mismatches, Journal of Computer and System Sciences, 115 2021, s. 73-85. Zobacz w PBN
• Panagiotis Charalampopoulos, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Computing Covers of 2D-Strings, 32nd Annual Symposium on Combinatorial Pattern Matching, Wrocław, Poland, 5 lipca 2021 - 7 lipca 2021, 191 2021, s. 12:1-12:20. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Juliusz Straszyński , Hardness of Detecting Abelian and Additive Square Factors in Strings, 29th Annual European Symposium on Algorithms (ESA 2019), Lizbona, Portugal, 5 września 2021 - 7 września 2021, 204 2021, s. 77:1-77:19. Zobacz w PBN
• Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Internal Dictionary Matching, Algorithmica, 83 (7) 2021, s. 2142-2169. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Juliusz Straszyński , Shortest covers of all cyclic shifts of a string, Theoretical Computer Science, 866 2021, s. 70-81. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Juliusz Straszyński , String Covers of a Tree, 28th International Symposium on String Processing and Information Retrieval, Lille, France, 4 października 2021 - 6 października 2021, 12944 2021, s. 68-82. Zobacz w PBN
• Wojciech Rytter , Wiktor Zuba, Syntactic view of sigma-tau generation of permutations, Theoretical Computer Science, 2021. Zobacz w PBN

2020

• Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , A Linear-Time Algorithm for Seeds Computation, ACM Transactions on Algorithms, 16 (2) 2020, s. 1-23. Zobacz w PBN
• Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Counting Distinct Patterns in Internal Dictionary Matching, 31st Annual Symposium on Combinatorial Pattern Matching, Copenhagen, Denmark, 17 czerwca 2020 - 19 czerwca 2020. Zobacz w PBN
• Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Efficient Enumeration of Distinct Factors Using Package Representations, 27th International Symposium on String Processing and Information Retrieval, Orlando, FL, the United States of America, 13 października 2020 - 15 października 2020. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Internal Quasiperiod Queries, 27th International Symposium on String Processing and Information Retrieval, Orlando, FL, the United States of America, 13 października 2020 - 15 października 2020. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Shortest Covers of All Cyclic Shifts of a String, The 14th International Conference and Workshops on Algorithms and Computation, Singapur, Singapore, 31 marca 2020 - 2 kwietnia 2020. Zobacz w PBN
• Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Arseny Shur, Tomasz Waleń , String periods in the order-preserving model, Information and Computation, 270 2020, s. 104463. Zobacz w PBN
• Panagiotis Charalampopoulos, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, The Number of Repetitions in 2D-Strings, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 września 2020 - 9 września 2020. Zobacz w PBN
• Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Universal reconstruction of a string, Theoretical Computer Science, 812 2020, s. 174-186. Zobacz w PBN

2019

• Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Circular Pattern Matching with k Mismatches, 22st International Symposium on Fundamentals of Computation Theory, Copenhagen, Denmark, 11 sierpnia 2019 - 14 sierpnia 2019. Zobacz w PBN
• Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Efficient enumeration of non-equivalent squares in partial words with few holes, Journal of Combinatorial Optimization, 37 (2) 2019, s. 501–522. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Efficient Representation and Counting of Antipower Factors in Words, 13th International Conference on Language and Automata Theory and Applications, Saint Petersburg, the Russian Federation, 26 marca 2019 - 29 marca 2019. Zobacz w PBN
• Jurek Czyzowicz, Jean Moussi, Krzysztof Diks , Wojciech Rytter , Energy-optimal broadcast and exploration in a tree using mobile agents, Theoretical Computer Science, 795 2019, s. 362-374. Zobacz w PBN
• Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Internal Dictionary Matching, 30th International Symposium on Algorithms and Computation, Shanghai, China, 9 grudnia 2019 - 11 grudnia 2019, 149 (22) 2019, s. 1-17. Zobacz w PBN
• Alzamel, Mai, Crochemore, Maxime, Iliopoulos S. Costas, Kociumaka Tomasz, Jakub Radoszewski , Wojciech Rytter , Waleń Tomasz, Zuba Wiktor, Juliusz Straszyński , Quasi-Linear-Time Algorithm for Longest Common Circular Factor, 30th Annual Symposium on Combinatorial Pattern Matching, Pisa, Italy, 18 czerwca 2019 - 20 czerwca 2019. Zobacz w PBN
• Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Weighted Shortest Common Supersequence Problem Revisited, 26th International Symposium on String Processing and Information Retrieval, Segovia, Spain, 7 października 2019 - 9 października 2019. Zobacz w PBN

2018

• Jerzy Czyżowicz, Krzysztof Diks , Jean Moussi, Wojciech Rytter , Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree, 25th International Colloquium on Structural Information and Communication Complexity, Ma'ale HaHamisha, Israel, 18 czerwca 2018 - 21 czerwca 2018. Zobacz w PBN
• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Efficient algorithms for shortest partial seeds in words, Theoretical Computer Science, 710 2018, s. 139-147. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba, Faster Recovery of Approximate Periods over Edit Distance, 25th International Symposium on String Processing and Information Retrieval, Lima, Peru, 9 października 2018 - 11 października 2018. Zobacz w PBN
• Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Linear-Time Algorithm for Long LCF with k Mismatches, 29th Annual Symposium on Combinatorial Pattern Matching, Qingdao, China, 2 lipca 2018 - 4 lipca 2018. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On Periodicity Lemma for Partial Words, 12th International Conference on Language and Automata Theory and Applications, Ramat Gan, Israel, 9 kwietnia 2018 - 11 kwietnia 2018. Zobacz w PBN
• Damian Repke, Wojciech Rytter , On Semi-perfect de Bruijn words, Theoretical Computer Science, 720 2018, s. 55-63. Zobacz w PBN
• Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the string consensus problem and the Manhattan sequence consensus problem, Theoretical Computer Science, 710 2018, s. 126-138. Zobacz w PBN
• Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Arseny M. Shur, Tomasz Waleń , String Periods in the Order-Preserving Model, The 35th International Symposium on Theoretical Aspects of Computer Science, Caen, France, 28 lutego 2018 - 3 marca 2018. Zobacz w PBN

2017

• Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. Zobacz w PBN
• Juha Kärkkäinen, Jakub Radoszewski , Wojciech Rytter , 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 28th Annual Symposium on Combinatorial Pattern Matching, Warszawa, Poland, 4 lipca 2017 - 6 lipca 2017. Zobacz w PBN
• Lech Banachowski, Krzysztof Diks , Wojciech Rytter , Algorytmy i struktury danych, 2017. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Covering problems for partial words and for indeterminate strings, Theoretical Computer Science, 698 2017, s. 25-39. Zobacz w PBN
• Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes, 23rd International Conference on Computing and Combinatorics, Hong Kong, China, 3 sierpnia 2017 - 5 sierpnia 2017. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet, Algorithmica, 77 (4) 2017, s. 1194 - 1215. Zobacz w PBN
• Jerzy Czyżowicz, Krzysztof Diks , Jean Moussi, Wojciech Rytter , Energy-Optimal Broadcast in a Tree with Mobile Agents, 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks , Vienna, Austria, 7 września 2017 - 8 września 2017. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Fast algorithms for Abelian periods in words and greatest common divisor queries, Journal of Computer and System Sciences, 84 2017, s. 205-218. Zobacz w PBN
• Jerzy Czyżowicz, Krzysztof Diks , Jean Moussi, Wojciech Rytter , Lecture Notes in Computer Science, 2017. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , String Powers in Trees, Algorithmica, 79 (3) 2017, s. 814–834. Zobacz w PBN

2016

• Krzysztof Diks , Wojciech Rytter , Jerzy Czyżowicz, Jean Moussi, Communication Problems for Mobile Agents Exchanging Energy, 23rd International Colloquium on Structural Information and Communication Complexity, Helsinki, Finland, 19 lipca 2016 - 21 lipca 2016. Zobacz w PBN
• Jerzy Czyżowicz, Krzysztof Diks , Jean Mussi, Wojciech Rytter , Communication Problems for Mobile Agents Exchanging Energy, Lecture Notes in Computer Science, Structural Information and Communication Complexity, 2016. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence, SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016. Zobacz w PBN
• Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter , Tomasz Waleń , Faster longest common extension queries in strings over general alphabets, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, 27 czerwca 2016 - 29 czerwca 2016. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Maximum number of distinct and nonequivalent nonstandard squares in a word, Theoretical Computer Science, 2016. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries, String Processing and Information Retrieval - 23rd International Symposium, 2016. Zobacz w PBN
• Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the greedy algorithm for the Shortest Common Superstring problem with reversals, Information Processing Letters, 2016. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Order-preserving indexing, Theoretical Computer Science, 2016. Zobacz w PBN
• Marek Cygan , Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics, 2016. Zobacz w PBN
• Wojciech Rytter , Two fast constructions of compact representations of binary words with given set of periods, Theoretical Computer Science, 2016. Zobacz w PBN

2015

• Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski , Wojciech Rytter , Bartosz Szreder, Tomasz Waleń , A note on the longest common compatible prefix problem for partial words, Journal of Discrete Algorithms, 2015. Zobacz w PBN
• Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski , Wojciech Rytter , Shiho Sugimoto, Tomasz Waleń , Efficient Algorithms for Longest Closed Factor Array, 22nd International Symposium on String Processing and Information Retrieval, London, the United Kingdom of Great Britain and Northern Ireland, 1 września 2015 - 4 września 2015. Zobacz w PBN
• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Fast Algorithm for Partial Covers in Words, Algorithmica, 2015. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Internal Pattern Matching Queries in a Text and Applications, ACM-SIAM Symposium on Discrete Algorithms, 2015. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Theoretical Computer Science, 2015. Zobacz w PBN
• Wojciech Rytter , Arseny Shur, Searching for Zimin patterns, Theoretical Computer Science, 2015. Zobacz w PBN
• Lukasz Mikulski, Marcin Piątkowski, Wojciech Rytter , Square-Free Words over Partially Commutative Alphabets, Lecture Notes in Computer Science, Language and Automata Theory and Applications 2015, Spain, 2015. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , String Powers in Trees, 26th Annual Symposium on Combinatorial Pattern Matching, Ischia, Italy, 29 czerwca 2015 - 1 lipca 2015. Zobacz w PBN
• Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter , Tomasz Waleń , Tight Bound for the Number of Distinct Palindromes in a Tree, 22nd International Symposium on String Processing and Information Retrieval, London, the United Kingdom of Great Britain and Northern Ireland, 1 września 2015 - 4 września 2015. Zobacz w PBN
• Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Universal Reconstruction of a String, 14th International Symposium on Algorithms and Data Structures, Victoria, Canada, 5 sierpnia 2015 - 7 sierpnia 2015. Zobacz w PBN

2014

• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence, Lecture Notes in Computer Science, Combinatorial Pattern Matching, Moskwa, the Russian Federation, 16 czerwca 2014 - 18 czerwca 2014. Zobacz w PBN
• Marcin Piątkowski, Wojciech Rytter , Computing the number of cubic runs in standard Sturmian words., Discrete Applied Mathematics, 163 (3) 2014, s. 361-372. Zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Covering Problems for Partial Words and for Indeterminate Strings, Lecture Notes in Computer Science, Algorithms and Computation - 25th International Symposium, Jeonju, the Republic of Korea, 17 grudnia 2014 - 19 grudnia 2014. Zobacz w PBN
• Tomasz Kociumaka, Solon Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Efficient Algorithms for Shortest Partial Seeds in Words, Lecture Notes in Computer Science, Combinatorial Pattern Matching, Moskwa, the Russian Federation, 16 czerwca 2014 - 18 czerwca 2014. Zobacz w PBN
• Wojciech Rytter , Efficient counting of square substrings in a tree., Theoretical Computer Science, 544 2014, s. 60-73. Zobacz w PBN
• Marcin Kubica, Jakub Radoszewski , Tomasz Waleń , Maxime Crochemore, Costas S. Iliopoulos, Wojciech Rytter , Extracting powers and periods in a word from its runs structure, Theoretical Computer Science, 521 (Complete) 2014, s. 29-41. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word, Lecture Notes in Computer Science, Developments in Language Theory, Ekaterinburg, the Russian Federation, 26 sierpnia 2014 - 29 sierpnia 2014. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski , Wojciech Rytter , Krzysztof Stencel , Tomasz Waleń , New simple efficient algorithms computing powers and runs in strings, Discrete Applied Mathematics, 2014. Zobacz w PBN
• Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the String Consensus Problem and the Manhattan Sequence Consensus Problem, Lecture Notes in Computer Science, String Processing and Information Retrieval, Ouro Preto, Brazil, 20 października 2014 - 22 października 2014. Zobacz w PBN

2013

• Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Kulczyński, Tomasz Waleń , A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters, 113 (12) 2013, s. 430-433. Zobacz w PBN
• Zbigniew Adamczyk, Wojciech Rytter , A note on a simple computation of the maximal suffix of a string, Journal of Discrete Algorithms, 20 (Complete) 2013, s. 61-64. Zobacz w PBN
• Wojciech Rytter , A note on efficient computation of all Abelian periods in a string., Information Processing Letters, 113 (3) 2013, s. 74-77. Zobacz w PBN
• Wojciech Rytter , Computing the Longest Previous Factor., European Journal of Combinatorics, 34 (1) 2013, s. 15-26. Zobacz w PBN
• Wojciech Rytter , Efficient indexes for jumbled pattern matching with constant-sized alphabet., Lecture Notes in Computer Science, 21st Annual European Symposium on Algorithms, Sophia Antipolis, France, 2 września 2013 - 4 września 2013, 8125 2013, s. 625-636. Zobacz w PBN
• Marcin Kubica, Jakub Radoszewski , Bartosz Szreder, Tomasz Waleń , Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, Wojciech Rytter , Efficient seed computation revisited, Theoretical Computer Science, 483 (Complete) 2013, s. 171-181. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Tomasz Kociumaka, Solon P. Pissis, Fast Algorithm for Partial Covers in Words, Lecture Notes in Computer Science, Combinatorial Pattern Matching, 7922 2013, s. 177-188. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 lutego 2013 - 2 marca 2013. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Lecture Notes in Computer Science, Language and Automata Theory and Applications, 7810 2013, s. 383-394. Zobacz w PBN
• Wojciech Rytter , On the maximum number of cubic subwords in a word., European Journal of Combinatorics, 34 (1) 2013, s. 27-37. Zobacz w PBN
• Marcin Kubica, Jakub Radoszewski , Tomasz Waleń , Tomasz Kociumaka, Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Solon P. Pissis, Wojciech Rytter , Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes, Lecture Notes in Computer Science, String Processing and Information Retrieval, 8214 2013, s. 84-95. Zobacz w PBN
• Wojciech Rytter , Paweł Baturo, Marcin Piątkowski, The Maximal Number of Runs in Standard Sturmian Words, ELECTRONIC JOURNAL OF COMBINATORICS, 20 [paper 13] (1) 2013, s. 1-22. Zobacz w PBN

2012

• Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , A linear time algorithm for seeds computation, 2012. Zobacz w PBN
• 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
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter , Tomasz Waleń , Efficient algorithms for three variants of the LPF table, Journal of Discrete Algorithms, 2012. Zobacz w PBN
• Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Efficient Counting of Square Substrings in a Tree, International Symposium on Algorithms and Computation (ISAAC), 2012. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Efficient Data Structures for the Factor Periodicity Problem, 2012. Zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the Maximal Number of Cubic Runs in a String, Journal of Computer and System Sciences, 2012. Zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the maximal sum of exponents of runs in a string, Journal of Discrete Algorithms, 2012. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , On the structure of compacted subword graphs of Thue-Morse words and their applications, Journal of Discrete Algorithms, 2012. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , The maximal number of cubic runs in a word, Journal of Computer and System Sciences, 2012. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Wojciech Tyczyński, Tomasz Waleń , The Maximum Number of Squares in a Tree, Combinatorial Pattern Matching, 2012. Zobacz w PBN

2011

• Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter , Bartosz Szreder, Tomasz Waleń , Efficient Seeds Computation Revisited, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Hamiltonian Paths in the Square of a Tree, Lecture Notes in Computer Science, International Symposium on Algorithms and Computation (ISAAC), 2011. Zobacz w PBN
• Marek Cygan , Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes in Computer Science, Combinatorial Pattern Matching, 2011. Zobacz w PBN

2010

• Maxime Crochemore, Marek Cygan , Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes in Computer Science, Combinatorial Pattern Matching, 2010. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter , Tomasz Waleń , Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup, Lecture Notes in Computer Science, Conference on Current Trends in Theory and Practice of Computer Science, 2010. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Extracting Powers and Periods in a String from Its Runs Structure, Lecture Notes in Computer Science, String Processing and Information Retrieval, 2010. Zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Krzysztof Stencel , Tomasz Waleń , New Simple Efficient Algorithms Computing Powers and Runs in Strings, Prague Stringology Conference, 2010. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the Maximal Number of Cubic Runs in a String, Lecture Notes in Computer Science, Language and Automata Theory and Applications, 2010. Zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the Maximal Sum of Exponents of Runs in a String, Lecture Notes in Computer Science, International Workshop on Combinatorial Algorithms, 2010. Zobacz w PBN
• Barbara Klunder, Wojciech Rytter , Post Correspondence Problem with Partially Commutative Alphabets, Lecture Notes in Computer Science, 2010. Zobacz w PBN

2009

• Paweł Baturo, Wojciech Rytter , Compressed string-matching in standard Sturmian words, Theoretical Computer Science, 2009. Zobacz w PBN
• Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter , Dora Souliou, Improved methods for extracting frequent itemsets from interim-support trees, Software - Practice and Experience, 2009. Zobacz w PBN
• Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter , Tomasz Waleń , LPF Computation Revisited, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the Maximal Number of Cubic Subwords in a String, Lecture Notes in Computer Science, International Workshop on Combinatorial Algorithms, 2009. Zobacz w PBN
• Maxime Crochemore, Lucian Ilie, Wojciech Rytter , Repetitions in strings: Algorithms and combinatorics, Theoretical Computer Science, 2009. Zobacz w PBN
• 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

2008

• Wojciech Frączak, Wojciech Rytter , Mohammadreza Yazdani, Matching Integer Intervals by Minimal Sets of Binary Words with don't cares, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Maxime Crochemore, Wojciech Rytter , Squares and Repetitions, 2008. Zobacz w PBN
• Paweł Baturo, Marcin Piatkowski, Wojciech Rytter , The Number of Runs in Sturmian Words, 2008. Zobacz w PBN

2007

• Costas Iliopoulos, M. Rahman, Wojciech Rytter , Algorithms for Two Versions of LCS Problem for Indeterminate Strings, 2007. Zobacz w PBN
• Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Efficient Computation of Throughput Values of Context-Free Languages, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Equivalence of simple functions, Theoretical Computer Science, 2007. Zobacz w PBN
• Wojciech Rytter , Parallel algorithms on strings, 2007. Zobacz w PBN
• Wojciech Fraczak, Wojciech Rytter , Mohammadreza Yazdani, TCAM representations of intervals of integers encoded by binary trees, 2007. Zobacz w PBN
• Wojciech Rytter , The number of runs in a string: improved analysis of the linear upper bound, Information and Computation, 2007. Zobacz w PBN
• Juhani Karhumaki, Yury Lifshits, Wojciech Rytter , Tiling Periodicity, Lecture Notes in Computer Science, 2007. Zobacz w PBN

2006

• Artur Czumaj, Wojciech Rytter , Broadcasting algorithms in radio networks with unknown topology, Journal of Algorithms-Cognition Informatics and Logic, 2006. Zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Equivalence of Functions Represented by Simple Context-Free Grammars with Output, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Sławomir Lasota , Wojciech Rytter , Faster algorithm for bisimulation equivalence of normed context-free processes, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Prime normal form and equivalence of simple grammars, Theoretical Computer Science, 2006. Zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Wojciech Rytter , The Number of Runs in a String: Improved Analysis of the Linear Upper Bound, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Wojciech Rytter , The structure of subword graphs and suffix trees of Fibonacci words, Theoretical Computer Science, 2006. 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
• F. Coenen, P. Leng, A. Pagourtzis, Wojciech Rytter , D. Souliou, Improved methods for extracting frequent itemsets from interin-support trees, 2005. Zobacz w PBN
• Juhani Karhumäki, Wojciech Plandowski , Wojciech Rytter , On the complexity of decidable cases of the commutation problem of languages, Theoretical Computer Science, 2005. Zobacz w PBN

2004

• Marek Chrobak, Leszek Gasieniec, Wojciech Rytter , A randomized algorithm for gossiping in radio networks, Networks, 2004. Zobacz w PBN
• Wojciech Rytter , Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Wojciech Rytter , Trees of minimum weighted path length, 2004. Zobacz w PBN

2003

• Wojciech Rytter , Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Theoretical Computer Science, 2003. Zobacz w PBN
• Aala Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter , Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique, Computer Journal, 2003. Zobacz w PBN
• Robert Benkoci, Marek Chrobak, Lawrence Larmore, Wojciech Rytter , Faster algorithms for k-medians in trees, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski , Wojciech Rytter , Occurrence and substring heuristics for delta-matching, Fundamenta Informaticae, 2003. Zobacz w PBN
• M. Crochemore, C.S. Iliopoulos, T. Lecroq, Y.J. Pinzon, W. Plandowski, Wojciech Rytter , Occurrence and Substring Heuristics for [ro]-Matching, Fundamenta Informaticae, 2003. Zobacz w PBN
• Wojciech Rytter , On maximal suffices and constant space versions of KMP algorithm, Theoretical Computer Science, 2003. Zobacz w PBN
• Artur Czumaj, Leszek Gasieniec, Daya Gaur, Ramesh Krishnamurti, Wojciech Rytter , Michele Zito, On polynomial-time approximation algorithms for the variable length scheduling problem, Theoretical Computer Science, 2003. Zobacz w PBN
• Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski , Wojciech Rytter , Relations between delta-matching and matching with don, Information Processing Letters, 2003. Zobacz w PBN
• Juhani Karhumaeki, Wojciech Plandowski , Wojciech Rytter , The complexity of compressing subsegments of images described by finite automata, Discrete Applied Mathematics, 2003. Zobacz w PBN

2002

• Wojciech Rytter , Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Maxime Crochemore, C. Iliopoulos, C. Makris, Wojciech Rytter , A. Tsakalidis, K. Tsichlas, Approximate string matching with gaps, Nordic Journal of Computing, 2002. Zobacz w PBN
• Bogdan Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter , Deterministic broadcasting in ad hoc radio networks, Distributed Computing, 2002. Zobacz w PBN
• Marek Chrobak, Leszek Gasieniec, Wojciech Rytter , Fast broadcasting and gossiping in radio networks, Journal of Algorithms-Cognition Informatics and Logic, 2002. Zobacz w PBN
• Krzysztof Diks , Wojciech Rytter , Mathematical Foundations of Computer Science 2002, 27th International Symposium, 2002. Zobacz w PBN
• A. Pagourtzis, I. Potapov, Wojciech Rytter , Observations on Parallel Computation of Transitive and Max-Closure Problems, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Wojciech Rytter , On maximal suffices and constant space versions of KMP algorithm, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Piotr Berman, Marek Karpinski, Lawrence Larmore, Wojciech Plandowski , Wojciech Rytter , On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Journal of Computer and System Sciences, 2002. Zobacz w PBN
• Phillip Bradford, Mordecai Golin, Lawrence Larmore, Wojciech Rytter , Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property, 2002. Zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski , Wojciech Rytter , Three heuristics for delta-matching: delta-BM algorithms, Lecture Notes in Computer Science, 2002. Zobacz w PBN

2001

• M. Chrobak, L. Gąsieniec, Wojciech Rytter , A randomized algorithm for gossiping in radio networks, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• A. Czumaj, I. Finch, A. Gibbons, L. Gąsieniec, P. Leng, Wojciech Rytter , M. Zito, Efficient web searching using temporal factors, Theoretical Computer Science, 2001. Zobacz w PBN
• J. Karhumaki, Wojciech Plandowski , Wojciech Rytter , On the complexity of decidable cases of commutation problem for languages, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• A. Pagourtzis, I. Potapov, Wojciech Rytter , PVM computation of transitive closure: the dependency graph approach, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• M. Chrobak, L. Larmore, Wojciech Rytter , The k-median problems for directed trees, Lecture Notes in Computer Science, 2001. Zobacz w PBN

2000

• Bogdan Chlebus, A Gibbons, L Gąsieniec, A Pelc, Wojciech Rytter , Deterministic broadcasting in unknown radio networks, 2000. Zobacz w PBN
• M Chrobak, L Gąsieniec, Wojciech Rytter , Fast broadcasting and gossiping in radio networks, 2000. Zobacz w PBN
• j Karhumaki, Wojciech Plandowski , Wojciech Rytter , Pattern matching for images generated by finite automata, 2000. Zobacz w PBN

Inne

• Jerzy Czyżowicz, Wojciech Rytter , Michał Włodarczyk , Evacuation from a Disc in the Presence of a Faulty Robot., Lecture Notes in Computer Science. Zobacz w PBN