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