Publikacje

Jakub Radoszewski

Liczba publikacji: 145

2024

• Shuo Li, Jakub Pachocki, Jakub Radoszewski , A Note on the Maximum Number of k-Powers in a Finite Word, ELECTRONIC JOURNAL OF COMBINATORICS, 31 (3) 2024, s. 1-10. Zobacz w PBN
• 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 , Wiktor Zuba, Computing String Covers in Sublinear Time, 31st International Symposium on String Processing and Information Retrieval, Puerto Vallarta, Mexico, 23 września 2024 - 25 września 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
• Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski , Maintaining the Size of LZ77 on Semi-Dynamic Strings, 35th Annual Symposium on Combinatorial Pattern Matching, Fukuoka, Japan, 25 czerwca 2024 - 27 czerwca 2024. Zobacz w PBN
• Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski , Pattern Masking for Dictionary Matching: Theory and Practice, Algorithmica, 86 (6) 2024, s. 1948-1978. Zobacz w PBN

2023

• Esteban Gabory, Njagi Moses, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski , Michelle Sweering, Wiktor Zuba, Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications, 34th Annual Symposium on Combinatorial Pattern Matching, Marne-la-Vallée, France, 26 czerwca 2023 - 28 czerwca 2023. Zobacz w PBN
• Jakub Radoszewski , Linear Time Construction of Cover Suffix Tree and Applications, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 września 2023 - 8 września 2023. Zobacz w PBN
• 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
• Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Juliusz Straszyński , Efficient Computation of Sequence Mappability, Algorithmica, 84 (5) 2022, s. 1418-1440. 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
• Andrzej Kędzierski, Jakub Radoszewski , k-Approximate Quasiperiodicity Under Hamming and Edit Distance, Algorithmica, 84 (3) 2022, s. 566-589. 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
• Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski , Longest Palindromic Substring in Sublinear Time, 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
• Patryk Czajka, Jakub Radoszewski , Experimental evaluation of algorithms for computing quasiperiods, Theoretical Computer Science, 854 2021, s. 17-29. Zobacz w PBN
• Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Faster Algorithms for Longest Common Substring, 29th Annual European Symposium on Algorithms (ESA 2019), Lizbona, Portugal, 5 września 2021 - 7 września 2021, 204 2021, s. 30:1-30:17. 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
• Shmuel T. Klein, Jakub Radoszewski , Tamar C. Serebro, Dana Shapira, Optimal skeleton and reduced Huffman trees, Theoretical Computer Science, 852 2021, s. 157--171. Zobacz w PBN
• Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski , Pattern Masking for Dictionary Matching, International Symposium on Algorithms and Computation, Fukuoka, Japan, 6 grudnia 2021 - 8 grudnia 2021. 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

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
• Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski , Tatiana Starikovskaya, Approximating Longest Common Substring with k mismatches: Theory and Practice, 31st Annual Symposium on Combinatorial Pattern Matching, Copenhagen, Denmark, 17 czerwca 2020 - 19 czerwca 2020. 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
• Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski , Dynamic and Internal Longest Common Substring, Algorithmica, 82 (12) 2020, s. 3707-3743. Zobacz w PBN
• Jakub Radoszewski , Juliusz Straszyński , Efficient Computation of 2-Covers of a String, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 września 2020 - 9 września 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
• Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski , Wing-Kin Sung, Faster algorithms for 1-mappability of a sequence, Theoretical Computer Science, 812 2020, s. 2-12. Zobacz w PBN
• Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski , Indexing weighted sequences: Neat and efficient, Information and Computation, 270 2020, s. 104462. 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
• Jakub Radoszewski , Aleksander Kędzierski, k-Approximate Quasiperiodicity under Hamming and Edit Distance, 31st Annual Symposium on Combinatorial Pattern Matching, Copenhagen, Denmark, 17 czerwca 2020 - 19 czerwca 2020. Zobacz w PBN
• Krzysztof Diks , Tomasz Idziaszek, Jakub Radoszewski , Jakub Łącki, Queieres un reto?, 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
• Jakub Radoszewski , Tatiana Starikovskaya, Streaming k-mismatch with error correcting and applications, Information and Computation, 271 2020, s. 104513. 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
• Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski , Tomasz Waleń , Wiktor Zuba, Unary Words Have the Smallest Levenshtein k-Neighbourhoods, 31st Annual Symposium on Combinatorial Pattern Matching, Copenhagen, Denmark, 17 czerwca 2020 - 19 czerwca 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
• 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
• Amihood Amir, Panagiotis Charalamp, Solon P. Pissis, Jakub Radoszewski , Longest Common Substring Made Fully Dynamic, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 września 2019 - 13 września 2019, 144 2019, s. 6:1--6:17. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Tatiana Starikovskaya, Longest Common Substring with Approximately k Mismatches, Algorithmica, 81 (6) 2019, s. 2633-2652. Zobacz w PBN
• Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski , On-line weighted pattern matching, Information and Computation, 266 2019, s. 49-59. 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
• Paweł Gawrychowski, Jakub Radoszewski , Tatiana Starikovskaya, Quasi-periodicity in streams, 30th Annual Symposium on Combinatorial Pattern Matching, Pisa, Italy, 18 czerwca 2019 - 20 czerwca 2019. Zobacz w PBN
• Maxime Crochemore, Jakub Radoszewski , Special issue in honor of the 70th birthday of Prof. Wojciech Rytter, Theoretical Computer Science, 792 2019, s. 1. 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

• 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
• Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Juliusz Straszyński , Efficient Computation of Sequence Mappability, 25th International Symposium on String Processing and Information Retrieval, Lima, Peru, 9 października 2018 - 11 października 2018. 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
• Krzysztof Diks , Tomasz Idziaszek, Jakub Radoszewski , Jakub Łącki, Looking for a Challenge, 2018. Zobacz w PBN
• Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski , On Abelian Longest Common Factor with and without RLE, Fundamenta Informaticae, 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
• 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
• 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
• 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

• 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
• 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
• 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
• Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski , Wing-Kin Sung, Faster Algorithms for 1-Mappability of a Sequence, 11th Annual International Conference on Combinatorial Optimization and Applications , Shanghai, China, 16 grudnia 2017 - 18 grudnia 2017. Zobacz w PBN
• Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski , Longest Common Factor After One Edit Operation, 24th International Symposium on String Processing and Information Retrieval, Palermo, Italy, 26 września 2017 - 29 września 2017. Zobacz w PBN
• Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski , Palindromic Decompositions with Gaps and Errors, 12th International Computer Science Symposium in Russia, Kazań, the Russian Federation, 8 czerwca 2017 - 12 czerwca 2017. Zobacz w PBN
• Jakub Radoszewski , Tatiana A. Starikovskaya, Streaming K-Mismatch with Error Correcting and Applications, 27th Data Compression Conference, Snowbird, the United States of America, 4 kwietnia 2017 - 7 kwietnia 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
• Tomasz Kociumaka, Jakub Radoszewski , Bartłomiej Wiśniewski, Subquadratic-Time Algorithms for Abelian Stringology Problems, AIMS Medical Science, 4 (3) 2017, s. 332-351. Zobacz w PBN
• Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski , Two strings at Hamming distance 1 cannot be both quasiperiodic, Information Processing Letters, 128 2017, s. 54-57. Zobacz w PBN
• Tomasz Idziaszek, Jakub Radoszewski , XXIII Olimpiada Informatyczna 2015/2016, 2017. Zobacz w PBN

2016

• Jakub Radoszewski , Tomasz Radzik, 2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW), Journal of Discrete Algorithms, 2016. Zobacz w PBN
• Adam Karczmarz , Jakub Radoszewski , Adam Polak, Jakub Wojtaszczyk, Jakub Łącki, Distributed Tasks: Introducing Distributed Computing to Programming Competitions, OLYMPIADS IN INFORMATICS, 10 2016, s. 177-194. Zobacz w PBN
• Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Efficient Index for Weighted Sequences, 27th Annual Symposium on Combinatorial Pattern Matching, 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
• 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
• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Pattern Matching and Consensus Problems on Weighted Sequences and Profiles, 27th International Symposium on Algorithms and Computation, Sydney, Australia, 12 grudnia 2016 - 14 grudnia 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
• Tomasz Kociumaka, Jakub Radoszewski , Bartłomiej Wiśniewski, Subquadratic-Time Algorithms for Abelian Stringology Problems, Mathematical Aspects of Computer and Information Sciences - 6th International Conference, 2016. Zobacz w PBN
• Costas S. Iliopoulos, Jakub Radoszewski , Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties, 27th Annual Symposium on Combinatorial Pattern Matching, 2016. Zobacz w PBN
• Tomasz Idziaszek, Jakub Radoszewski , XXII Olimpiada Informatyczna 2014/2015, 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
• 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, 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
• 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
• 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
• Jakub Radoszewski , More Algorithms Without Programming, OLYMPIADS IN INFORMATICS, 8 2014, s. 157-168. 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
• 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
• 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
• Jakub Pachocki, Jakub Radoszewski , Where to Use and How not to Use Polynomial String Hashing, OLYMPIADS IN INFORMATICS, 7 2013, s. 90-100. Zobacz w PBN
• Bartłomiej Gajewski, Tomasz Idziaszek, Marcin Kubica, Jakub Radoszewski , XX Olimpiada Informatyczna 2012/2013, 2013. 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
• 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
• Krzysztof Diks , Tomasz Idziaszek, Jakub Radoszewski , Jakub Łącki, Looking for a Challenge? The Ultimate Problem Set from the University of Warsaw Programming Competitions, 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
• Krzysztof Diks , Tomasz Idziaszek, Jakub Radoszewski , Jakub Łącki, W poszukiwaniu wyzwań. Wybór zadań z konkursów programistycznych Uniwersytetu Warszawskiego, 2012. Zobacz w PBN
• Tomasz Idziaszek, Marcin Kubica, Jakub Radoszewski , XIX Olimpiada Informatyczna 2011/2012, 2012. Zobacz w PBN

2011

• Marcin Kubica, Jakub Radoszewski , CEOI 2011. Tasks and Solutions, 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
• Tomasz Kulczyński, Jakub Radoszewski , Jakub Łącki, Stimulating Students' Creativity with Tasks Solved Using Precomputation and Visualization, OLYMPIADS IN INFORMATICS, 2011. Zobacz w PBN
• Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski , XVIII Olimpiada Informatyczna 2010/2011, 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
• Marcin Kubica, Jakub Radoszewski , Algorithms without Programming, OLYMPIADS IN INFORMATICS, 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
• Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski , XVII Olimpiada Informatyczna 2009/2010, 2010. Zobacz w PBN

2009

• 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
• Marcin Andrychowicz, Marcin Kubica, Jakub Radoszewski , XVI Olimpiada Informatyczna 2008/2009, 2009. Zobacz w PBN

2008

• Krzysztof Diks , Marcin Kubica, Jakub Radoszewski , Krzysztof Stencel , A Proposal for a Task Preparation Process, 2008. Zobacz w PBN
• Adam Iwanicki, Przemysława Kanarek, Jakub Radoszewski , XV Olimpiada Informatyczna 2007/2008, 2008. Zobacz w PBN