Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Wojciech Rytter
2018
- 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
- Damian Repke i Wojciech Rytter, On Semi-perfect de Bruijn words, Theoretical Computer Science 720 2018, s. 55–63.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
- 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
- Krzysztof Diks, Jerzy Czyżowicz, Jean Moussi i Wojciech Rytter, Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. SIROCCO 2018: 209-225, Lecture Notes In Computer Science 2018, s. 209–225.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
2017
- 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
- Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter i Lorenzo ClementeFilip Murlak (red.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.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
- 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 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
- Lech Banachowski, Krzysztof Diks i Wojciech Rytter, Algorytmy i struktury danych, Wydawnictwo Naukowe PWN, Warszawa 2017.zobacz w PBN
- Krzysztof Diks, Wojciech Rytter, Jerzy Czyżowicz i Jean Moussi (red.), Lecture Notes in Computer Science, 2017.zobacz w PBN
- Jerzy Czyżowicz, Krzysztof Diks, Jean Moussi i Wojciech Rytter, Energy-Optimal Broadcast in a Tree with Mobile Agents, w: Lecture Notes in Computer Science, 2017.zobacz w PBN
- Jerzy Czyżowicz, Wojciech Rytter i Michał Włodarczyk, Evacuation from a Disc in the Presence of a Faulty Robot., w: Lecture Notes in Computer Science, Springer-Verlag, 2014.zobacz w PBN
2016
- 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
- Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter i Tomasz Waleń, Faster longest common extension queries in strings over general alphabets, w: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 2016, r. 5, s. 5:1–5:13.zobacz w PBN
- Wojciech Rytter, Two fast constructions of compact representations of binary words with given set of periods, Theoretical Computer Science 656, Part B 2016, s. 180–187.zobacz w PBN
- Jerzy Czyżowicz, Krzysztof Diks, Jean Mussi i Wojciech Rytter, Communication Problems for Mobile Agents Exchanging Energy, Lecture Notes In Computer Science 9988 2016, s. 275–288.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
- Jerzy Czyżowicz, Krzysztof Diks, Jean Moussi i Wojciech Rytter, Communication Problems for Mobile Agents Exchanging Energy, w: Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers, Springer International Publishing, 2016, s. 275–288.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
- 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
- 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
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
- Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter i Tomasz Waleń, Tight Bound for the Number of Distinct Palindromes in a Tree, w: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, 2015, s. 270–276.zobacz w PBN
- Arseny Shur i Wojciech Rytter, Searching for Zimin patterns, Theoretical Computer Science 571 2015, s. 50–57.zobacz w PBN
- Lukasz Mikulski, Marcin Piątkowski i Wojciech Rytter, Square-Free Words over Partially Commutative Alphabets, Lecture Notes In Computer Science 8977 2015, s. 424–435.zobacz w PBN
2014
- 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
- 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
- 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
- Zbigniew Adamczyk i 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
- Paweł Baturo, Marcin Piątkowski i Wojciech Rytter, The Maximal Number of Runs in Standard Sturmian Words, Electronic Journal Of Combinatorics 2013.zobacz w PBN
- Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Computing the Longest Previous Factor, European Journal Of Combinatorics 34 (1) 2013, s. 15–26.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
2012
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Efficient algorithms for three variants of the LPF table, Journal Of Discrete Algorithms 11 2012, s. 51–61.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
- 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
- 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
- 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
- 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
- Marcin Piatkowski i Wojciech Rytter, Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words, International Journal Of Foundations Of Computer Science 23 (2) 2012, s. 303–321.zobacz w PBN
2011
- Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient Seeds Computation Revisited, Lecture Notes In Computer Science 6661 2011, s. 350–363.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
- 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
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
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays, Lecture Notes In Computer Science 5901 2010, s. 296–307.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
- Barbara Klunder i Wojciech Rytter, Post Correspondence Problem with Partially Commutative Alphabets, Lecture Notes In Computer Science 6031 2010, s. 356–367.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
2009
- Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter i Dora Souliou, Improved methods for extracting frequent itemsets from interim-support trees, Software-practice & Experience 39 (6) 2009, s. 551–571.zobacz w PBN
- Paweł Baturo i Wojciech Rytter, Compressed string-matching in standard Sturmian words, Theoretical Computer Science 410 (30-32) 2009, s. 2804–2810.zobacz w PBN
- Maxime Crochemore, Lucian Ilie i Wojciech Rytter, Repetitions in strings: Algorithms and combinatorics, Theoretical Computer Science 410 (50) 2009, s. 5227–5235.zobacz w PBN
- Marcin Piątkowski i Wojciech Rytter, Usefullness of directed acyclic graphs in problems related to standard Sturmian words, International Journal Of Foundations Of Computer Science 20 (6) 2009, s. 1005–1023.zobacz w PBN
- Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Subwords in a String, Lecture Notes In Computer Science 5874 2009, s. 345–355.zobacz w PBN
- Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, LPF Computation Revisited, Lecture Notes In Computer Science 5874 2009, s. 158–169.zobacz w PBN
2008
- Wojciech Frączak, Wojciech Rytter i Mohammadreza Yazdani, Matching Integer Intervals by Minimal Sets of Binary Words with don't cares, Lecture Notes In Computer Science 5029 2008, s. 217–229.zobacz w PBN
- Paweł Baturo, Marcin Piatkowski i Wojciech Rytter, The Number of Runs in Sturmian Words, w: CIAA, 2008.zobacz w PBN
- Maxime Crochemore i Wojciech Rytter, Squares and Repetitions, w: Encyclopedia of Algorithms, 2008.zobacz w PBN
2007
- Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Equivalence of simple functions, Theoretical Computer Science 376 (1) 2007, s. 42–51.zobacz w PBN
- Wojciech Rytter, The number of runs in a string: improved analysis of the linear upper bound, Information And Computation 205 (9) 2007, s. 1459–1469.zobacz w PBN
- Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Efficient Computation of Throughput Values of Context-Free Languages, Lecture Notes In Computer Science 4783 2007, s. 203–213.zobacz w PBN
- Juhani Karhumaki, Yury Lifshits i Wojciech Rytter, Tiling Periodicity, Lecture Notes In Computer Science 4580 2007, s. 295–306.zobacz w PBN
- Costas Iliopoulos, M. Rahman i Wojciech Rytter, Algorithms for Two Versions of LCS Problem for Indeterminate Strings, w: 18th International Workshop on Combinatorial Algorithms, London 2007.zobacz w PBN
- Wojciech Rytter, Parallel algorithms on strings, w: Handbook of Parallel Computing: Models, Algorithms and Applications, Chapman and Hall, Dordrecht 2007.zobacz w PBN
- Wojciech Fraczak, Wojciech Rytter i Mohammadreza Yazdani, TCAM representations of intervals of integers encoded by binary trees, w: 18th International Workshop on Combinatorial Algorithms, College Publications, London 2007.zobacz w PBN
2006
- Wojciech Rytter, The structure of subword graphs and suffix trees of Fibonacci words, Theoretical Computer Science 363 2006, s. 211–223.zobacz w PBN
- Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Prime normal form and equivalence of simple grammars, Theoretical Computer Science 363 (2) 2006, s. 124–134.zobacz w PBN
- Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Equivalence of Functions Represented by Simple Context-Free Grammars with Output, Lecture Notes In Computer Science 4036 2006, s. 71–82.zobacz w PBN
- Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice, Lecture Notes In Computer Science 4094 2006, s. 90–101.zobacz w PBN
- Sławomir Lasota i Wojciech Rytter, Faster algorithm for bisimulation equivalence of normed context-free processes, Lecture Notes In Computer Science 4162 2006, s. 646–657.zobacz w PBN
- Wojciech Rytter, The Number of Runs in a String: Improved Analysis of the Linear Upper Bound, Lecture Notes In Computer Science 3884 2006, s. 184–195.zobacz w PBN
- Artur Czumaj i Wojciech Rytter, Broadcasting algorithms in radio networks with unknown topology, Journal Of Algorithms-cognition Informatics And Logic 60 (2) 2006, s. 115–143.zobacz w PBN
2005
- Juhani Karhumäki, Wojciech Plandowski i Wojciech Rytter, On the complexity of decidable cases of the commutation problem of languages, Theoretical Computer Science 337 (1-3) 2005, s. 105–118.zobacz w PBN
- Costas Iliopoulos, James MCHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter i Marie-France Sagot, A first approach to finding common motifs with gaps, International Journal Of Foundations Of Computer Science 16 (6) 2005, s. 1145–1155.zobacz w PBN
- F. Coenen, P. Leng, A. Pagourtzis, Wojciech Rytter i D. Souliou, Improved methods for extracting frequent itemsets from interin-support trees, w: 25th International Conference on Innovative Techniques and Applications of Artificial Intelligence, Springer, London 2005.zobacz w PBN
2004
- Wojciech Rytter, Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input, Lecture Notes In Computer Science 3142 2004, s. 15–27.zobacz w PBN
- Marek Chrobak, Leszek Gasieniec i Wojciech Rytter, A randomized algorithm for gossiping in radio networks, Networks 43 (2) 2004, s. 119–124.zobacz w PBN
- Wojciech Rytter, Trees of minimum weighted path length, w: Handbook of data structures and applications, Chapman and Hall, USA 2004.zobacz w PBN
2003
- Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski i Wojciech Rytter, Occurrence and substring heuristics for delta-matching, Fundamenta Informaticae 56 (1) 2003, s. 1–21.zobacz w PBN
- Robert Benkoci, Marek Chrobak, Lawrence Larmore i Wojciech Rytter, Faster algorithms for k-medians in trees, Lecture Notes In Computer Science 2747 2003, s. 218–227.zobacz w PBN
- Artur Czumaj, Leszek Gasieniec, Daya Gaur, Ramesh Krishnamurti, Wojciech Rytter i Michele Zito, On polynomial-time approximation algorithms for the variable length scheduling problem, Theoretical Computer Science 302 2003, s. 489–495.zobacz w PBN
- Juhani Karhumaeki, Wojciech Plandowski i Wojciech Rytter, The complexity of compressing subsegments of images described by finite automata, Discrete Applied Mathematics 125 (2-3) 2003, s. 235–254.zobacz w PBN
- Wojciech Rytter, Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Theoretical Computer Science 299 (1-3) 2003, s. 763–774.zobacz w PBN
- Wojciech Rytter, On maximal suffices and constant space versions of KMP algorithm, Theoretical Computer Science 302 2003, s. 211–222.zobacz w PBN
- Aala Gibbons, Aris Pagourtzis, Igor Potapov i Wojciech Rytter, Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique, Computer Journal 46 (4) 2003, s. 391–400.zobacz w PBN
- Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski i Wojciech Rytter, Relations between delta-matching and matching with don, Information Processing Letters 85 (5) 2003, s. 227–233.zobacz w PBN
2002
- Wojciech Rytter, Phillip Bradford, Mordecai Golin i Lawrence Larmore, Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property, Journal Of Algorithms-cognition Informatics And Logic 42 (2) 2002, s. 277–303.zobacz w PBN
- Bogdan Chlebus, Leszek Gasieniec, Alan Gibbons, Wojciech Rytter i Andrzej Pelc, Deterministic broadcasting in ad hoc radio networks, Distributed Computing 15 2002, s. 27–38.zobacz w PBN
- Maxime Crochemore, C. Iliopoulos, C. Makris, Wojciech Rytter, A. Tsakalidis i K. Tsichlas, Approximate string matching with gaps, Nordic Journal Of Computing 9 2002, s. 54–65.zobacz w PBN
- Marek Chrobak, Leszek Gasieniec i Wojciech Rytter, Fast broadcasting and gossiping in radio networks, Journal Of Algorithms-cognition Informatics And Logic 43 (2) 2002, s. 177–189.zobacz w PBN
- Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski i Wojciech Rytter, Three heuristics for delta-matching: delta-BM algorithms, Lecture Notes In Computer Science 2373 2002, s. 178–189.zobacz w PBN
- A. Pagourtzis, I. Potapov i Wojciech Rytter, Observations on Parallel Computation of Transitive and Max-Closure Problems, Lecture Notes In Computer Science 2474 2002, s. 217–225.zobacz w PBN
- Wojciech Rytter, Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Lecture Notes In Computer Science 2373 2002, s. 20–31.zobacz w PBN
- Wojciech Rytter, On maximal suffices and constant space versions of KMP algorithm, Lecture Notes In Computer Science 2286 2002, s. 196–208.zobacz w PBN
- Krzysztof Diks i Wojciech Rytter (red.), Mathematical Foundations of Computer Science 2002, 27th International Symposium, Springer, Berlin 2002.zobacz w PBN
- Piotr Berman, Marek Karpinski, Lawrence Larmore, Wojciech Plandowski i Wojciech Rytter, On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Journal Of Computer And System Sciences 65 (2) 2002, s. 332–350.zobacz w PBN
2001
- A. Czumaj, I. Finch, L. Gąsieniec, A. Gibbons, P. Leng, Wojciech Rytter i M. Zito, Efficient web searching using temporal factors, Theoretical Computer Science 262 (1) 2001, s. 569–582.zobacz w PBN
- Wojciech Rytter, L. Larmore i M. Chrobak, The k-median problems for directed trees, Lecture Notes In Computer Science 2136 2001, s. 260–269.zobacz w PBN
- Wojciech Plandowski, Wojciech Rytter i J. Karhumaki, On the complexity of decidable cases of commutation problem for languages, Lecture Notes In Computer Science (2138) 2001, s. 193–203.zobacz w PBN
- Wojciech Rytter, I. Potapov i A. Pagourtzis, PVM computation of transitive closure: the dependency graph approach, Lecture Notes In Computer Science (2131) 2001, s. 249–259.zobacz w PBN
- Wojciech Rytter, M. Chrobak i L. Gąsieniec, A randomized algorithm for gossiping in radio networks, Lecture Notes In Computer Science 2108 2001, s. 483–492.zobacz w PBN
2000
- Bogdan Chlebus, L Gąsieniec, A Gibbons, A Pelc i Wojciech Rytter, Deterministic broadcasting in unknown radio networks, w: Proc. 11-th ACM-SIAM Symp. on Discrete Algorithms, ACM, San Francisco, California 2000.zobacz w PBN
- Wojciech Rytter, M Chrobak i L Gąsieniec, Fast broadcasting and gossiping in radio networks, w: Proc. 41 IEEE Symposium on Foundations of Computer Sciencs, IEEE, Londyn 2000.zobacz w PBN
- Wojciech Plandowski, Wojciech Rytter i j Karhumaki, Pattern matching for images generated by finite automata, Nordic Journal Of Computing 7 (1) 2000, s. 1–13.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
