Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarWojciech Rytter
Person information
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j125]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the string consensus problem and the Manhattan sequence consensus problem. Theor. Comput. Sci. 710: 126-138 (2018)- [j124]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for shortest partial seeds in words. Theor. Comput. Sci. 710: 139-147 (2018) - [j123]Damian Repke, Wojciech Rytter:
On semi-perfect de Bruijn words. Theor. Comput. Sci. 720: 55-63 (2018) - [c120]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. LATA 2018: 232-244 - [c119]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. STACS 2018: 38:1-38:16 - [i27]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. CoRR abs/1801.01096 (2018) - [i26]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. CoRR abs/1801.01404 (2018) - [i25]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR abs/1802.06369 (2018) - 2017
- [j122]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. Algorithmica 77(4): 1194-1215 (2017) - [j121]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
String Powers in Trees. Algorithmica 79(3): 814-834 (2017) - [j120]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Fast algorithms for Abelian periods in words and greatest common divisor queries. J. Comput. Syst. Sci. 84: 205-218 (2017) - [j119]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698: 25-39 (2017) - [c118]Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Energy-Optimal Broadcast in a Tree with Mobile Agents. ALGOSENSORS 2017: 98-113 - [c117]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON 2017: 99-111 - [c116]Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk:
Evacuation from a Disc in the Presence of a Faulty Robot. SIROCCO 2017: 158-173 - [e3]Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter:
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. LIPIcs 78, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2017, ISBN 978-3-95977-039-2 [contents] - 2016
- [j118]Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Polynomial-time approximation algorithms for weighted LCS problem. Discrete Applied Mathematics 204: 38-48 (2016) - [j117]Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the greedy algorithm for the Shortest Common Superstring problem with reversals. Inf. Process. Lett. 116(3): 245-251 (2016) - [j116]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. SIAM J. Discrete Math. 30(4): 2027-2046 (2016) - [j115]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-preserving indexing. Theor. Comput. Sci. 638: 122-135 (2016) - [j114]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. 648: 84-95 (2016) - [j113]Wojciech Rytter:
Two fast constructions of compact representations of binary words with given set of periods. Theor. Comput. Sci. 656: 180-187 (2016) - [c115]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CPM 2016: 5:1-5:13 - [c114]Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Communication Problems for Mobile Agents Exchanging Energy. SIROCCO 2016: 275-288 - [c113]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE 2016: 22-34 - [r4]Maxime Crochemore, Wojciech Rytter:
Squares and Repetitions. Encyclopedia of Algorithms 2016: 2056-2060 - [i24]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CoRR abs/1602.00447 (2016) - [i23]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. CoRR abs/1604.02238 (2016) - [i22]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR abs/1606.08275 (2016) - 2015
- [j112]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. Algorithmica 73(1): 217-233 (2015) - [j111]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34: 49-53 (2015) - [j110]Wojciech Rytter, Arseny M. Shur:
Searching for Zimin patterns. Theor. Comput. Sci. 571: 50-57 (2015) - [j109]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theor. Comput. Sci. 602: 7-21 (2015) - [c112]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
String Powers in Trees. CPM 2015: 284-294 - [c111]Lukasz Mikulski, Marcin Piatkowski, Wojciech Rytter:
Square-Free Words over Partially Commutative Alphabets. LATA 2015: 424-435 - [c110]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Pattern Matching Queries in a Text and Applications. SODA 2015: 532-551 - [c109]Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen:
Efficient Algorithms for Longest Closed Factor Array. SPIRE 2015: 95-102 - [c108]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE 2015: 270-276 - [c107]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Universal Reconstruction of a String. WADS 2015: 386-397 - [i21]Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter:
Testing k-binomial equivalence. CoRR abs/1509.00622 (2015) - [i20]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. CoRR abs/1510.02637 (2015) - [i19]Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Algorithms for Communication Problems for Mobile Agents Exchanging Energy. CoRR abs/1511.05987 (2015) - [i18]Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals. CoRR abs/1511.08431 (2015) - 2014
- [j108]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New simple efficient algorithms computing powers and runs in strings. Discrete Applied Mathematics 163: 258-267 (2014) - [j107]Marcin Piatkowski, Wojciech Rytter:
Computing the number of cubic runs in standard Sturmian words. Discrete Applied Mathematics 163: 361-372 (2014) - [j106]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521: 29-41 (2014) - [j105]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient counting of square substrings in a tree. Theor. Comput. Sci. 544: 60-73 (2014) - [c106]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Algorithms for Shortest Partial Seeds in Words. CPM 2014: 192-201 - [c105]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. CPM 2014: 202-211 - [c104]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory 2014: 215-226 - [c103]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC 2014: 220-232 - [c102]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE 2014: 244-255 - [i17]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CoRR abs/1401.0163 (2014) - [i16]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. CoRR abs/1407.6144 (2014) - [i15]
- [i14]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. CoRR abs/1412.3696 (2014) - 2013
- [j104]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
The Maximal Number of Runs in Standard Sturmian Words. Electr. J. Comb. 20(1): P13 (2013) - [j103]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Computing the Longest Previous Factor. Eur. J. Comb. 34(1): 15-26 (2013) - [j102]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximum number of cubic subwords in a word. Eur. J. Comb. 34(1): 27-37 (2013) - [j101]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113(3): 74-77 (2013) - [j100]Marcin Kubica, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113(12): 430-433 (2013) - [j99]Zbigniew Adamczyk, Wojciech Rytter:
A note on a simple computation of the maximal suffix of a string. J. Discrete Algorithms 20: 61-64 (2013) - [j98]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient seed computation revisited. Theor. Comput. Sci. 483: 171-181 (2013) - [c101]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CPM 2013: 177-188 - [c100]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. ESA 2013: 625-636 - [c99]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA 2013: 383-394 - [c98]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE 2013: 84-95 - [c97]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. STACS 2013: 245-256 - [i13]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Suffix Trees and Their Algorithmic Applications. CoRR abs/1303.6872 (2013) - [i12]Radoslaw Glowinski, Wojciech Rytter:
Compressed Pattern-Matching with Ranked Variables in Zimin Words. CoRR abs/1307.1560 (2013) - [i11]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. CoRR abs/1311.6235 (2013) - [i10]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR abs/1312.2381 (2013) - 2012
- [j97]Marcin Piatkowski, Wojciech Rytter:
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Int. J. Found. Comput. Sci. 23(2): 303-321 (2012) - [j96]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
The maximal number of cubic runs in a word. J. Comput. Syst. Sci. 78(6): 1828-1836 (2012) - [j95]Jakub Radoszewski, Wojciech Rytter:
On the structure of compacted subword graphs of Thue-Morse words and their applications. J. Discrete Algorithms 11: 15-24 (2012) - [j94]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11: 51-61 (2012) - [j93]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal sum of exponents of runs in a string. J. Discrete Algorithms 14: 29-36 (2012) - [c96]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
The Maximum Number of Squares in a Tree. CPM 2012: 27-40 - [c95]Wojciech Rytter, Bartosz Szreder:
Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric. FUN 2012: 346-356 - [c94]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Counting of Square Substrings in a Tree. ISAAC 2012: 207-216 - [c93]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A linear time algorithm for seeds computation. SODA 2012: 1095-1112 - [c92]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Data Structures for the Factor Periodicity Problem. SPIRE 2012: 284-294 - [c91]
- [i9]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A Note on Efficient Computation of All Abelian Periods in a String. CoRR abs/1208.3313 (2012) - 2011
- [c90]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CPM 2011: 350-363 - [c89]Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM 2011: 455-466 - [c88]
- [c87]Marcin Piatkowski, Wojciech Rytter:
Computing the Number of Cubic Runs in Standard Sturmian Words. Stringology 2011: 106-120 - [c86]Radoslaw Glowinski, Wojciech Rytter:
Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words. Stringology 2011: 162-172 - [i8]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CoRR abs/1104.3153 (2011) - [i7]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A Linear Time Algorithm for Seeds Computation. CoRR abs/1107.2422 (2011) - 2010
- [j92]Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. Discrete Mathematics & Theoretical Computer Science 12(2): 237-248 (2010) - [c85]Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM 2010: 299-309 - [c84]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Sum of Exponents of Runsin a String. IWOCA 2010: 10-19 - [c83]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Number of Cubic Runs in a String. LATA 2010: 227-238 - [c82]Barbara Klunder, Wojciech Rytter:
Post Correspondence Problem with Partially Commutative Alphabets. LATA 2010: 356-367 - [c81]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM 2010: 296-307 - [c80]Jakub Radoszewski, Wojciech Rytter:
Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup. SOFSEM 2010: 663-671 - [c79]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Extracting Powers and Periods in a String from Its Runs Structure. SPIRE 2010: 258-269 - [c78]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology 2010: 138-149 - [i6]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal sum of exponents of runs in a string. CoRR abs/1003.4866 (2010)
2000 – 2009
- 2009
- [j91]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Int. J. Found. Comput. Sci. 20(6): 1005-1023 (2009) - [j90]Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou:
Improved methods for extracting frequent itemsets from interim-support trees. Softw., Pract. Exper. 39(6): 551-571 (2009) - [j89]Pawel Baturo, Wojciech Rytter:
Compressed string-matching in standard Sturmian words. Theor. Comput. Sci. 410(30-32): 2804-2810 (2009) - [j88]Costas S. Iliopoulos, Wojciech Rytter:
Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore. Theor. Comput. Sci. 410(43): 4293-4294 (2009) - [j87]Maxime Crochemore, Lucian Ilie, Wojciech Rytter:
Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci. 410(50): 5227-5235 (2009) - [c77]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
LPF Computation Revisited. IWOCA 2009: 158-169 - [c76]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Number of Cubic Subwords in a String. IWOCA 2009: 345-355 - [c75]Marcin Piatkowski, Wojciech Rytter:
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Stringology 2009: 237-248 - [i5]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal number of highly periodic runs in a string. CoRR abs/0907.2157 (2009) - [i4]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal number of cubic subwords in a string. CoRR abs/0911.1370 (2009) - 2008
- [c74]Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani:
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. CPM 2008: 217-229 - [c73]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Stringology 2008: 193-207 - [c72]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
The Number of Runs in Sturmian Words. CIAA 2008: 252-261 - [e2]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
Structure-Based Compression of Complex Massive Data, 22.06. - 27.06.2008. Dagstuhl Seminar Proceedings 08261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r3]
- [i3]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data 2008 - [i2]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
08261 Executive Summary - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data 2008 - 2007
- [j86]
- [j85]Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice. Int. J. Found. Comput. Sci. 18(4): 715-725 (2007) - [j84]Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Equivalence of simple functions. Theor. Comput. Sci. 376(1-2): 42-51 (2007) - [c71]
- [c70]Pawel Baturo, Wojciech Rytter:
Occurrence and Lexicographic Properties of Standard Sturmian Words. LATA 2007: 79-90 - [c69]Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Efficient Computation of Throughput Values of Context-Free Languages. CIAA 2007: 203-213 - [r2]
- 2006
- [j83]