Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Jakub Radoszewski
2018
- Szymon Grabowski, Tomasz Kociumaka and Jakub Radoszewski, On Abelian Longest Common Factor with and without RLE, Fundamenta Informaticae 163 (3) 2018, p. 225–244.see in PBN
- Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the string consensus problem and the Manhattan sequence consensus problem, Theoretical Computer Science 710 2018, p. 126–138.see in PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient algorithms for shortest partial seeds in words, Theoretical Computer Science 710 2018, p. 139–147.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń and Wiktor Zuba, Faster Recovery of Approximate Periods over Edit Distance, in: String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings, 2018, p. 233–240.see in PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Linear-Time Algorithm for Long LCF with k Mismatches, in: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 23, p. 23:1–23:16.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On Periodicity Lemma for Partial Words, in: Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings, Springer, 2018, p. 232–244.see in PBN
- Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur and Tomasz Waleń, String Periods in the Order-Preserving Model, in: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 38, p. 38:1–38:16.see in PBN
- Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski and Juliusz Straszyński, Efficient Computation of Sequence Mappability, in: String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings, 2018, p. 12–26.see in PBN
- Michał Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos and Jakub Jan Radoszewski, Palindromic Decompositions with Gaps and Errors, International Journal Of Foundations Of Computer Science 29 (08) 2018, p. 1311–1329.see in PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient enumeration of non-equivalent squares in partial words with few holes, Journal Of Combinatorial Optimization 2018.see in PBN
2017
- Juha Karkkainen, Jakub Jan Radoszewski and Wojciech Rytter (eds.), 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.see in PBN
- Tomasz Idziaszek and Jakub Jan Radoszewski (eds.), XXIII Olimpiada Informatyczna 2015/2016, Warszawa 2017.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski and Wojciech Rytter, Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet, Algorithmica 77 (4) 2017, p. 1194–1215.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, String Powers in Trees, Algorithmica 79 (3) 2017, p. 814–834.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Covering problems for partial words and for indeterminate strings, Theoretical Computer Science 698 2017, p. 25–39.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski and Wojciech Rytter, Fast algorithms for Abelian periods in words and greatest common divisor queries, Journal Of Computer And System Sciences 84 2017, p. 205–218.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski and Bartłomiej Wiśniewski, Subquadratic-Time Algorithms for Abelian Stringology Problems, Aims Medical Science 4 (3) 2017, p. 332–351.see in PBN
- Amihood Amir, Costas S. Iliopoulos and Jakub Jan Radoszewski, Two strings at Hamming distance 1 cannot be both quasiperiodic, Information Processing Letters 128 2017, p. 54–57.see in PBN
- Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Jan Radoszewski and Wing-Kin Sung, Faster Algorithms for 1-Mappability of a Sequence, in: Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II, 2017, p. 109–121.see in PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes, in: Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, 2017, p. 99–111.see in PBN
- Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos and Jakub Jan Radoszewski, Palindromic Decompositions with Gaps and Errors, in: Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings, 2017, p. 48–61.see in PBN
- Jakub Jan Radoszewski and Tatiana A. Starikovskaya, Streaming K-Mismatch with Error Correcting and Applications, in: 2017 Data Compression Conference, DCC 2017, 2017, p. 290–299.see in PBN
- Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis and Jakub Jan Radoszewski, Longest Common Factor After One Edit Operation, in: String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings, 2017, p. 14–26.see in PBN
2016
- Tomasz Kociumaka, Solon P. Pissis and Jakub Jan Radoszewski, Pattern Matching and Consensus Problems on Weighted Sequences and Profiles, in: 27th International Symposium on Algorithms and Computation, 2016, p. 46:1–46:12.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries, in: String Processing and Information Retrieval - 23rd International Symposium, 2016, p. 22–34.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski and Bartłomiej Wiśniewski, Subquadratic-Time Algorithms for Abelian Stringology Problems, in: Mathematical Aspects of Computer and Information Sciences - 6th International Conference, 2016, p. 320–334.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski and Wojciech Rytter, Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence, Siam Journal On Discrete Mathematics 30 (4) 2016, p. 2027–2046.see in PBN
- Adam Karol Karczmarz, Jakub Włodzimierz Łącki, Adam Polak, Jakub Jan Radoszewski and Jakub Wojtaszczyk, Distributed Tasks: Introducing Distributed Computing to Programming Competitions, Olympiads In Informatics 10 2016, p. 177–194.see in PBN
- Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the greedy algorithm for the Shortest Common Superstring problem with reversals, Information Processing Letters 116 (3) 2016, p. 245–251.see in PBN
- Tomasz Idziaszek and Jakub Jan Radoszewski (eds.), XXII Olimpiada Informatyczna 2014/2015, Komitet Główny Olimpiady Informatycznej, Warszawa 2016.see in PBN
- Marek Adam Cygan, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics 204 2016, p. 38–48.see in PBN
- Jakub Jan Radoszewski and Tomasz Radzik, 2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW), Journal Of Discrete Algorithms 37 2016, p. 1–2.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Maximum number of distinct and nonequivalent nonstandard squares in a word, Theoretical Computer Science 648 2016, p. 84–95.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Order-preserving indexing, Theoretical Computer Science 638 2016, p. 122–135.see in PBN
- Costas S. Iliopoulos and Jakub Jan Radoszewski, Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties, in: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 2016, p. 8:1–8:12.see in PBN
- Carl Barton, Tomasz Kociumaka, Solon P. Pissis and Jakub Jan Radoszewski, Efficient Index for Weighted Sequences, in: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 2016, p. 4:1–4:13.see in PBN
2015
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Internal Pattern Matching Queries in a Text and Applications, in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2015, p. 532–551.see in PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Algorithmica 73 (1) 2015, p. 217–233.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Theoretical Computer Science 602 2015, p. 7–21.see in PBN
- Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder and Tomasz Waleń, A note on the longest common compatible prefix problem for partial words, Journal Of Discrete Algorithms 34 2015, p. 49–53.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, String Powers in Trees, in: Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, Springer, 2015, p. 284–294.see in PBN
- Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Universal Reconstruction of a String, in: Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, Springer, 2015, p. 386–397.see in PBN
- Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto and Tomasz Waleń, Efficient Algorithms for Longest Closed Factor Array, in: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, 2015, p. 95–102.see in PBN
2014
- Jakub Jan Radoszewski, More Algorithms Without Programming, Olympiads In Informatics 8 2014, p. 157–168.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Extracting powers and periods in a word from its runs structure, Theoretical Computer Science 521 (Complete) 2014, p. 29–41.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Krzysztof Stencel and Tomasz Waleń, New simple efficient algorithms computing powers and runs in strings, Discrete Applied Mathematics 163 2014, p. 258–267.see in PBN
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient counting of square substrings in a tree, Theoretical Computer Science 544 2014, p. 60–73.see in PBN
- Tomasz Kociumaka, Solon Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient Algorithms for Shortest Partial Seeds in Words, Lecture Notes In Computer Science 8486 2014, p. 192–201.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word, Lecture Notes In Computer Science 8633 2014, p. 215–226.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski and Wojciech Rytter, Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence, Lecture Notes In Computer Science 8486 2014, p. 202–211.see in PBN
- Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Covering Problems for Partial Words and for Indeterminate Strings, Lecture Notes In Computer Science 8889 2014, p. 220––232.see in PBN
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the String Consensus Problem and the Manhattan Sequence Consensus Problem, Lecture Notes In Computer Science 8799 2014, p. 244–255.see in PBN
2013
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński and Tomasz Waleń, A note on efficient computation of all Abelian periods in a string, Information Processing Letters 113 (3) 2013, p. 74–77.see in PBN
- Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the maximum number of cubic subwords in a word, European Journal Of Combinatorics 34 (1) 2013, p. 27–37.see in PBN
- Jakub Pachocki and Jakub Jan Radoszewski, Where to Use and How not to Use Polynomial String Hashing, Olympiads In Informatics 7 2013, p. 90–100.see in PBN
- Bartłomiej Gajewski, Tomasz Idziaszek, Marcin Kubica and Jakub Jan Radoszewski (eds.), XX Olimpiada Informatyczna 2012/2013, Komitet Główny Olimpiady Informatycznej, Warszawa 2013.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski and Wojciech Rytter, Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries, in: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, p. 245–256.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes, Lecture Notes In Computer Science 8214 2013, p. 84–95.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Lecture Notes In Computer Science 7810 2013, p. 383–394.see in PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski and Wojciech Rytter, Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet, Lecture Notes In Computer Science 8125 2013, p. 625–636.see in PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Lecture Notes In Computer Science 7922 2013, p. 177–188.see in PBN
- Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter, Bartosz Szreder and Tomasz Waleń, Efficient seed computation revisited, Theoretical Computer Science 483 (Complete) 2013, p. 171–181.see in PBN
- Marcin Kubica, Tomasz Kulczyński, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters 113 (12) 2013, p. 430–433.see in PBN
2012
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient Counting of Square Substrings in a Tree, in: Lecture Notes in Computer Science, Springer, Heidelberg 2012, r. 7676, p. 207–216.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński and Tomasz Waleń, The Maximum Number of Squares in a Tree, in: Computer Vision and Graphics. International Conference, ICCVG 2012, Warsaw, Poland, September 24-26, 2012. Proceedings, Springer, Berlin 2012, r. 7354, p. 27–40.see in PBN
- Maxime Crochemore, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the maximal sum of exponents of runs in a string, Journal Of Discrete Algorithms 14 2012, p. 29–36.see in PBN
- Krzysztof Diks, Tomasz Idziaszek, Jakub Włodzimierz Łącki and Jakub Jan Radoszewski (eds.), W poszukiwaniu wyzwań. Wybór zadań z konkursów programistycznych Uniwersytetu Warszawskiego, Uniwersytet Warszawski, Warszawa 2012.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, The maximal number of cubic runs in a word, Journal Of Computer And System Sciences 78 (6) 2012, p. 1828–1836.see in PBN
- Krzysztof Diks, Tomasz Idziaszek, Jakub Łącki and Jakub Jan Radoszewski (eds.), Looking for a Challenge? The Ultimate Problem Set from the University of Warsaw Programming Competitions, Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego, Warszawa 2012.see in PBN
- Jakub Radoszewski and Wojciech Rytter, On the structure of compacted subword graphs of Thue-Morse words and their applications, Journal Of Discrete Algorithms 11 2012, p. 15–24.see in PBN
- Tomasz Idziaszek, Marcin Kubica and Jakub Jan Radoszewski (eds.), XIX Olimpiada Informatyczna 2011/2012, Komitet Główny Olimpiady Informatycznej, Warszawa 2012.see in PBN
- Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Journal Of Computer And System Sciences 78 (6) 2012, p. 1828–1836.see in PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Efficient Data Structures for the Factor Periodicity Problem, in: SPIRE, 2012.see in PBN
- Tomasz Kociumaka, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, A linear time algorithm for seeds computation, in: SODA, 2012, p. 1095–1112.see in PBN
2011
- Tomasz Kulczyński, Jakub Łącki and Jakub Jan Radoszewski, Stimulating Students' Creativity with Tasks Solved Using Precomputation and Visualization, Olympiads In Informatics 5 2011, p. 71–81.see in PBN
- Tomasz Kociumaka, Marcin Kubica and Jakub Jan Radoszewski (eds.), XVIII Olimpiada Informatyczna 2010/2011, Komitet Główny Olimpiady Informatycznej, Warszawa 2011.see in PBN
- Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes In Computer Science 6661 2011, p. 455–466.see in PBN
- Michałis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder and Tomasz Waleń, Efficient Seeds Computation Revisited, in: CPM, 2011.see in PBN
- Jakub Radoszewski and Wojciech Rytter, Hamiltonian Paths in the Square of a Tree, Lecture Notes In Computer Science 7074 2011, p. 90–99.see in PBN
- Marcin Kubica and Jakub Radoszewski (eds.), CEOI 2011. Tasks and Solutions, Komitet Główny Olimpiady Informatycznej, Gdynia 2011.see in PBN
2010
- Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes In Computer Science 6129 2010, p. 299–309.see in PBN
- Jakub Radoszewski and Wojciech Rytter, Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup, Lecture Notes In Computer Science 5901 2010, p. 663–671.see in PBN
- Marcin Kubica and Jakub Jan Radoszewski, Algorithms without Programming, Olympiads In Informatics 4 2010, p. 52–66.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Extracting Powers and Periods in a String from Its Runs Structure, Lecture Notes In Computer Science 6393 2010, p. 258–269.see in PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Lecture Notes In Computer Science 6031 2010, p. 227–238.see in PBN
- Tomasz Kociumaka, Marcin Kubica and Jakub Jan Radoszewski (eds.), XVII Olimpiada Informatyczna 2009/2010, Komitet Główny Olimpiady Informatycznej, Warszawa 2010.see in PBN
- Marcin Kubica, Wojciech Rytter, Tomasz Waleń, Krzysztof Stencel, Jakub Radoszewski, Maxime Crochemore and Costas Iliopoulos, New Simple Efficient Algorithms Computing Powers and Runs in Strings, in: PSC, 2010, p. 138–149.see in PBN
- Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, On the Maximal Sum of Exponents of Runs in a String, Lecture Notes In Computer Science 6460 2010, p. 10–19.see in PBN
You are not logged in | log in
