Wojciech Rytter

348 papers A* 10A 13B 65C 34Misc 10Journal 185Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Internal quasiperiod queries. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2025	J	`jnl`	25 Additional Problems - Extension to the Book "125 Problems in Text Algorithms". CoRR Maxime Crochemore, Thierry Lecroq, Wojciech Rytter
2025	B	`conf`	Counting Distinct Square Substrings in Sublinear Time. MFCS Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2025	J	`jnl`	Counting Distinct Square Substrings in Sublinear Time. CoRR Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2025	J	`jnl`	Subsequence Covers of Words. CoRR Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2025	J	`jnl`	Subsequence covers of words. Theor. Comput. Sci. Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2024	A	`conf`	Approximate Circular Pattern Matching Under Edit Distance. STACS Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2024	J	`jnl`	Approximate Circular Pattern Matching under Edit Distance. CoRR Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2024	C	`conf`	Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. SPIRE Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2024	J	`jnl`	Internal Pattern Matching Queries in a Text and Applications. SIAM J. Comput. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2023	B	`conf`	Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2023	J	`jnl`	Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2022	J	`jnl`	A periodicity lemma for partial words. Inf. Comput. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2022	A	`conf`	Approximate Circular Pattern Matching. ESA Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2022	J	`jnl`	Approximate Circular Pattern Matching. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2022	J	`jnl`	Efficient representation and counting of antipower factors in words. Inf. Comput. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022	B	`conf`	Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022	B	`conf`	Rectangular Tile Covers of 2D-Strings. CPM Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022	C	`conf`	Subsequence Covers of Words. SPIRE Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2021	J	`jnl`	Circular pattern matching with J. Comput. Syst. Sci. Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021	B	`conf`	Computing Covers of 2D-Strings. CPM Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2021	J	`jnl`	Gossiping by energy-constrained mobile agents in tree networks. Theor. Comput. Sci. Jurek Czyzowicz, Dariusz Dereniowski, Robert Ostrowski, Wojciech Rytter
2021	A	`conf`	Hardness of Detecting Abelian and Additive Square Factors in Strings. ESA Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021	J	`jnl`	Hardness of Detecting Abelian and Additive Square Factors in Strings. CoRR Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021	J	`jnl`	Internal Dictionary Matching. Algorithmica Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2021	J	`jnl`	Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021	C	`conf`	String Covers of a Tree. SPIRE Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021	J	`jnl`	Syntactic view of sigma-tau generation of permutations. Theor. Comput. Sci. Wojciech Rytter, Wiktor Zuba
2020	J	`jnl`	A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2020	B	`conf`	Counting Distinct Patterns in Internal Dictionary Matching. CPM Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	J	`jnl`	Counting Distinct Patterns in Internal Dictionary Matching. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	C	`conf`	Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020	C	`conf`	Internal Quasiperiod Queries. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	J	`jnl`	Internal Quasiperiod Queries. CoRR Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	B	`conf`	Shortest Covers of All Cyclic Shifts of a String. WALCOM Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	J	`jnl`	String periods in the order-preserving model. Inf. Comput. Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2020	A	`conf`	The Number of Repetitions in 2D-Strings. ESA Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020	J	`jnl`	The Number of Repetitions in 2D-Strings. CoRR Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020	J	`jnl`	Tight Bound for the Number of Distinct Palindromes in a Tree. CoRR Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2020	J	`jnl`	Universal reconstruction of a string. Theor. Comput. Sci. Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	B	`conf`	Circular Pattern Matching with k Mismatches. FCT Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Circular Pattern Matching with k Mismatches. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	C	`conf`	Efficient Representation and Counting of Antipower Factors in Words. LATA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	J	`jnl`	Energy-optimal broadcast and exploration in a tree using mobile agents. Theor. Comput. Sci. Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2019	B	`conf`	Internal Dictionary Matching. ISAAC Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	J	`jnl`	Internal Dictionary Matching. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	—	`conf`	On the Cyclic Regularities of Strings. AIAI (Workshops) Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson
2019	J	`jnl`	On the cyclic regularities of strings. CoRR Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson
2019	B	`conf`	Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	C	`conf`	Syntactic View of Sigma-Tau Generation of Permutations. LATA Wojciech Rytter, Wiktor Zuba
2019	J	`jnl`	Syntactic View of Sigma-Tau Generation of Permutations. CoRR Wojciech Rytter, Wiktor Zuba
2019	C	`conf`	Weighted Shortest Common Supersequence Problem Revisited. SPIRE Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Weighted Shortest Common Supersequence Problem Revisited. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	B	`conf`	Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. SIROCCO Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2018	J	`jnl`	Efficient Representation and Counting of Antipower Factors in Words. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	J	`jnl`	Efficient algorithms for shortest partial seeds in words. Theor. Comput. Sci. Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	C	`conf`	Faster Recovery of Approximate Periods over Edit Distance. SPIRE Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	J	`jnl`	Faster Recovery of Approximate Periods over Edit Distance. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018	—	`conf`	How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	B	`conf`	Linear-Time Algorithm for Long LCF with k Mismatches. CPM Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	J	`jnl`	Linear-Time Algorithm for Long LCF with k Mismatches. CoRR Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	C	`conf`	On Periodicity Lemma for Partial Words. LATA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	J	`jnl`	On Periodicity Lemma for Partial Words. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	J	`jnl`	On semi-perfect de Bruijn words. Theor. Comput. Sci. Damian Repke, Wojciech Rytter
2018	J	`jnl`	On the string consensus problem and the Manhattan sequence consensus problem. Theor. Comput. Sci. Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	A	`conf`	String Periods in the Order-Preserving Model. STACS Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2018	J	`jnl`	String Periods in the Order-Preserving Model. CoRR Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2017	B	`ed.`	28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, July 4-6, 2017 CPM Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter
2017	J	`jnl`	Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017	Misc	`conf`	Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017	J	`jnl`	Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. Algorithmica Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2017	C	`conf`	Energy-Optimal Broadcast in a Tree with Mobile Agents. ALGOSENSORS Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2017	B	`conf`	Evacuation from a Disc in the Presence of a Faulty Robot. SIROCCO Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk
2017	J	`jnl`	Fast algorithms for Abelian periods in words and greatest common divisor queries. J. Comput. Syst. Sci. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2017	J	`jnl`	String Powers in Trees. Algorithmica Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	B	`conf`	Communication Problems for Mobile Agents Exchanging Energy. SIROCCO Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2016	J	`jnl`	Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. SIAM J. Discret. Math. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2016	B	`conf`	Faster Longest Common Extension Queries in Strings over General Alphabets. CPM Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Faster Longest Common Extension Queries in Strings over General Alphabets. CoRR Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	C	`conf`	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	On the greedy algorithm for the Shortest Common Superstring problem with reversals. Inf. Process. Lett. Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Order-preserving indexing. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Polynomial-time approximation algorithms for weighted LCS problem. Discret. Appl. Math. Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	—	`ch.`	Squares and Repetitions. Encyclopedia of Algorithms Maxime Crochemore, Wojciech Rytter
2016	J	`jnl`	Two fast constructions of compact representations of binary words with given set of periods. Theor. Comput. Sci. Wojciech Rytter
2015	J	`jnl`	A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2015	J	`jnl`	Algorithms for Communication Problems for Mobile Agents Exchanging Energy. CoRR Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2015	C	`conf`	Efficient Algorithms for Longest Closed Factor Array. SPIRE Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen
2015	J	`jnl`	Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2015	J	`jnl`	Fast Algorithm for Partial Covers in Words. Algorithmica Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	A*	`conf`	Internal Pattern Matching Queries in a Text and Applications. SODA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	J	`jnl`	Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theor. Comput. Sci. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	J	`jnl`	On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals. CoRR Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	J	`jnl`	Searching for Zimin patterns. Theor. Comput. Sci. Wojciech Rytter, Arseny M. Shur
2015	C	`conf`	Square-Free Words over Partially Commutative Alphabets. LATA Lukasz Mikulski, Marcin Piatkowski, Wojciech Rytter
2015	B	`conf`	String Powers in Trees. CPM Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015	J	`jnl`	Testing k-binomial equivalence. CoRR Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter
2015	C	`conf`	Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2015	B	`conf`	Universal Reconstruction of a String. WADS Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	B	`conf`	Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. CPM Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2014	J	`jnl`	Computing the number of cubic runs in standard Sturmian words. Discret. Appl. Math. Marcin Piatkowski, Wojciech Rytter
2014	B	`conf`	Covering Problems for Partial Words and for Indeterminate Strings. ISAAC Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Covering Problems for Partial Words and for Indeterminate Strings. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	B	`conf`	Efficient Algorithms for Shortest Partial Seeds in Words. CPM Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Efficient counting of square substrings in a tree. Theor. Comput. Sci. Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Fast Algorithm for Partial Covers in Words. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen
2014	C	`conf`	Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
2014	J	`jnl`	On Searching Zimin Patterns. CoRR Wojciech Rytter, Arseny M. Shur
2014	C	`conf`	On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	On the String Consensus Problem and the Manhattan Sequence Consensus Problem. CoRR Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013	J	`jnl`	A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. Marcin Kubica, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	A note on a simple computation of the maximal suffix of a string. J. Discrete Algorithms Zbigniew Adamczyk, Wojciech Rytter
2013	J	`jnl`	A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2013	J	`jnl`	Compressed Pattern-Matching with Ranked Variables in Zimin Words. CoRR Radoslaw Glowinski, Wojciech Rytter
2013	J	`jnl`	Computing the Longest Previous Factor. Eur. J. Comb. Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2013	A	`conf`	Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. ESA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2013	J	`jnl`	Efficient seed computation revisited. Theor. Comput. Sci. Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013	B	`conf`	Fast Algorithm for Partial Covers in Words. CPM Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	A	`conf`	Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. STACS Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2013	C	`conf`	Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	On the maximum number of cubic subwords in a word. Eur. J. Comb. Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. CoRR Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	C	`conf`	Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	Order-Preserving Suffix Trees and Their Algorithmic Applications CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	The Maximal Number of Runs in Standard Sturmian Words. Electron. J. Comb. Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
2012	J	`jnl`	A Note on Efficient Computation of All Abelian Periods in a String CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012	A*	`conf`	A linear time algorithm for seeds computation. SODA Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	J	`jnl`	Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Int. J. Found. Comput. Sci. Marcin Piatkowski, Wojciech Rytter
2012	Misc	`conf`	Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric. FUN Wojciech Rytter, Bartosz Szreder
2012	B	`conf`	Efficient Counting of Square Substrings in a Tree. ISAAC Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	C	`conf`	Efficient Data Structures for the Factor Periodicity Problem. SPIRE Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	J	`jnl`	Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2012	J	`jnl`	On the maximal sum of exponents of runs in a string. J. Discrete Algorithms Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	J	`jnl`	On the structure of compacted subword graphs of Thue-Morse words and their applications. J. Discrete Algorithms Jakub Radoszewski, Wojciech Rytter
2012	B	`conf`	The Maximum Number of Squares in a Tree. CPM Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012	Misc	`conf`	The Number of Cubes in Sturmian Words. PSC Marcin Piatkowski, Wojciech Rytter
2012	J	`jnl`	The maximal number of cubic runs in a word. J. Comput. Syst. Sci. Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2011	J	`jnl`	A Linear Time Algorithm for Seeds Computation CoRR Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2011	Misc	`conf`	Computing the Number of Cubic Runs in Standard Sturmian Words. PSC Marcin Piatkowski, Wojciech Rytter
2011	J	`jnl`	Efficient Seeds Computation Revisited CoRR Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011	B	`conf`	Efficient Seeds Computation Revisited. CPM Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011	B	`conf`	Hamiltonian Paths in the Square of a Tree. ISAAC Jakub Radoszewski, Wojciech Rytter
2011	Misc	`conf`	Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words. PSC Radoslaw Glowinski, Wojciech Rytter
2011	B	`conf`	Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	B	`conf`	Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	B	`conf`	Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2010	B	`conf`	Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup. SOFSEM Jakub Radoszewski, Wojciech Rytter
2010	C	`conf`	Extracting Powers and Periods in a String from Its Runs Structure. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	Misc	`conf`	New Simple Efficient Algorithms Computing Powers and Runs in Strings. PSC Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
2010	C	`conf`	On the Maximal Number of Cubic Runs in a String. LATA Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	C	`conf`	On the Maximal Sum of Exponents of Runsin a String. IWOCA Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	J	`jnl`	On the maximal sum of exponents of runs in a string CoRR Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	C	`conf`	Post Correspondence Problem with Partially Commutative Alphabets. LATA Barbara Klunder, Wojciech Rytter
2010	J	`jnl`	Tiling Periodicity. Discret. Math. Theor. Comput. Sci. Juhani Karhumäki, Yury Lifshits, Wojciech Rytter
2009	Misc	`conf`	Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. PSC Marcin Piatkowski, Wojciech Rytter
2009	J	`jnl`	Compressed string-matching in standard Sturmian words. Theor. Comput. Sci. Pawel Baturo, Wojciech Rytter
2009	J	`jnl`	Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore. Theor. Comput. Sci. Costas S. Iliopoulos, Wojciech Rytter
2009	J	`jnl`	Improved methods for extracting frequent itemsets from interim-support trees. Softw. Pract. Exp. Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou
2009	C	`conf`	LPF Computation Revisited. IWOCA Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2009	C	`conf`	On the Maximal Number of Cubic Subwords in a String. IWOCA Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009	J	`jnl`	On the maximal number of cubic subwords in a string CoRR Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009	J	`jnl`	On the maximal number of highly periodic runs in a string CoRR Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009	J	`jnl`	Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci. Maxime Crochemore, Lucian Ilie, Wojciech Rytter
2009	J	`jnl`	Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Int. J. Found. Comput. Sci. Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
2008	—	`conf`	08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter
2008	—	`conf`	08261 Executive Summary - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter
2008	B	`conf`	Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. CPM Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani
2008	—	`ch.`	Squares and Repetitions. Encyclopedia of Algorithms Maxime Crochemore, Wojciech Rytter
2008	—	`ed.`	Structure-Based Compression of Complex Massive Data, 22.06. - 27.06.2008 Structure-Based Compression of Complex Massive Data Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter
2008	C	`conf`	The Number of Runs in Sturmian Words. CIAA Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
2008	Misc	`conf`	Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. PSC Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
2007	C	`conf`	Efficient Computation of Throughput Values of Context-Free Languages. CIAA Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
2007	J	`jnl`	Equivalence of simple functions. Theor. Comput. Sci. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
2007	C	`conf`	Occurrence and Lexicographic Properties of Standard Sturmian Words. LATA Pawel Baturo, Wojciech Rytter
2007	—	`ch.`	Parallel Algorithms on Strings. Handbook of Parallel Computing Wojciech Rytter
2007	J	`jnl`	Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice. Int. J. Found. Comput. Sci. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
2007	J	`jnl`	The number of runs in a string. Inf. Comput. Wojciech Rytter
2007	B	`conf`	Tiling Periodicity. CPM Juhani Karhumäki, Yury Lifshits, Wojciech Rytter
2006	J	`jnl`	Broadcasting algorithms in radio networks with unknown topology. J. Algorithms Artur Czumaj, Wojciech Rytter
2006	C	`conf`	Equivalence of Functions Represented by Simple Context-Free Grammars with Output. Developments in Language Theory Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
2006	B	`conf`	Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. MFCS Slawomir Lasota, Wojciech Rytter
2006	J	`jnl`	Prime normal form and equivalence of simple grammars. Theor. Comput. Sci. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
2006	C	`conf`	Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. CIAA Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
2006	A	`conf`	The Number of Runs in a String: Improved Analysis of the Linear Upper Bound. STACS Wojciech Rytter
2006	J	`jnl`	The structure of subword graphs and suffix trees of Fibonacci words. Theor. Comput. Sci. Wojciech Rytter
2005	J	`jnl`	A first approach to finding common motifs with gaps. Int. J. Found. Comput. Sci. Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
2005	—	`conf`	Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. SGAI Conf. Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou
2005	J	`jnl`	On the complexity of decidable cases of the commutation problem of languages. Theor. Comput. Sci. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
2005	C	`conf`	Prime Normal Form and Equivalence of Simple Grammars. CIAA Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
2005	C	`conf`	The Structure of Subword Graphs and Suffix Trees of Fibonacci Words. CIAA Wojciech Rytter
2004	Misc	`conf`	A First Approach to Finding Common Motifs With Gaps. PSC Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
2004	J	`jnl`	A randomized algorithm for gossiping in radio networks. Networks Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
2004	A*	`conf`	Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input. ICALP Wojciech Rytter
2004	—	`ch.`	Trees with Minimum Weighted Path Length. Handbook of Data Structures and Applications Wojciech Rytter
2003	J	`jnl`	Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. Wojciech Rytter
2003	A*	`conf`	Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS Artur Czumaj, Wojciech Rytter
2003	J	`jnl`	Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter
2003	B	`conf`	Faster Algorithms for MFCS Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
2003	J	`jnl`	Linear-Time Prime Decomposition Of Regular Prefix Codes. Int. J. Found. Comput. Sci. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
2003	J	`jnl`	On maximal suffixes, constant-space linear-time versions of KMP algorithm. Theor. Comput. Sci. Wojciech Rytter
2003	J	`jnl`	On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
2003	J	`jnl`	On special families of morphisms related to [delta]-matching and don't care symbols. Inf. Process. Lett. Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
2003	J	`jnl`	The complexity of compressing subsegments of images described by finite automata. Discret. Appl. Math. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
2002	B	`conf`	Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. CPM Wojciech Rytter
2002	J	`jnl`	Approximate String Matching with Gaps. Nord. J. Comput. Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, Kostas Tsichlas
2002	J	`jnl`	Deterministic broadcasting in ad hoc radio networks. Distributed Comput. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
2002	J	`jnl`	Fast broadcasting and gossiping in radio networks. J. Algorithms Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
2002	—	`book`	Jewels of stringology. Maxime Crochemore, Wojciech Rytter
2002	B	`ed.`	Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings MFCS Krzysztof Diks, Wojciech Rytter
2002	—	`conf`	Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI Aris Pagourtzis, Igor Potapov, Wojciech Rytter
2002	B	`conf`	On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm. LATIN Wojciech Rytter
2002	J	`jnl`	On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
2002	J	`jnl`	Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
2002	C	`conf`	Prime Decompositions of Regular Prefix Codes. CIAA Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
2002	B	`conf`	Three Heuristics for delta-Matching: delta-BM Algorithms. CPM Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
2001	Misc	`conf`	A Randomized Algorithm for Gossiping in Radio Networks. COCOON Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
2001	J	`jnl`	Efficient web searching using temporal factors. Theor. Comput. Sci. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
2001	B	`conf`	On the Complexity of Decidable Cases of Commutation Problem for Languages. FCT Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
2001	—	`conf`	PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI Aris Pagourtzis, Igor Potapov, Wojciech Rytter
2001	B	`conf`	The k-Median Problem for Directed Trees. MFCS Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
2000	J	`jnl`	Compressed and fully compressed pattern matching in one and two dimensions. Proc. IEEE Wojciech Rytter
2000	A*	`conf`	Deterministic broadcasting in unknown radio networks. SODA Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
2000	A*	`conf`	Fast Broadcasting and Gossiping in Radio Networks. FOCS Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
2000	J	`jnl`	Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata. Nord. J. Comput. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1999	B	`conf`	Algorithms on Compressed Strings and Arrays. SOFSEM Wojciech Rytter
1999	B	`conf`	Almost Optimal Fully LZW-Compressed Pattern Matching. Data Compression Conference Leszek Gasieniec, Wojciech Rytter
1999	—	`conf`	Complexity of Language Recognition Problems for Compressed Words. Jewels are Forever Wojciech Plandowski, Wojciech Rytter
1999	J	`jnl`	Constant-Space String-Matching in Sublinear Average Time. Theor. Comput. Sci. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
1999	B	`conf`	Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. MFCS Leszek Gasieniec, Alan Gibbons, Wojciech Rytter
1999	B	`conf`	Efficient Web Searching Using Temporal Factors. WADS Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
1999	J	`jnl`	Fast Practical Multi-Pattern Matching. Inf. Process. Lett. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
1999	J	`jnl`	Generalized Factorizations of Words and Their Algorithmic Properties. Theor. Comput. Sci. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1999	B	`conf`	The Compression of Subsegments of Images Described by Finite Automata. CPM Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1998	J	`jnl`	A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. SIAM J. Comput. Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter
1998	J	`jnl`	Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. Theor. Comput. Sci. Lawrence L. Larmore, Wojciech Rytter
1998	J	`jnl`	Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns. Theor. Comput. Sci. Marek Karpinski, Wojciech Rytter
1998	A*	`conf`	Application of Lempel-Ziv Encodings to the Solution of Words Equations. ICALP Wojciech Plandowski, Wojciech Rytter
1998	J	`jnl`	On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. Parallel Process. Lett. Marek Karpinski, Wojciech Rytter
1998	—	`conf`	On the PVM Computations of Transitive Closure and Algebraic Path Problems. PVM/MPI Ken J. Chan, Alan Gibbons, Marcelo Pias, Wojciech Rytter
1998	A	`conf`	Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. ESA Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
1997	J	`jnl`	An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. Nord. J. Comput. Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
1997	J	`jnl`	Constant-Time Randomized Parallel String Matching. SIAM J. Comput. Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
1997	—	`conf`	Constant-space string-matching in sublinear average time. SEQUENCES Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
1997	J	`jnl`	Correctness of Constructing Optimal Alphabetic Trees Revisited. Theor. Comput. Sci. Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
1997	B	`conf`	On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
1997	—	`conf`	On the PVM/MPI Computations of Dynamic Programming Recurrences. PVM/MPI Vassil Alexandrow, Ken Chan, Alan Gibbons, Wojciech Rytter
1997	B	`conf`	Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. FCT Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1997	J	`jnl`	Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
1996	J	`jnl`	A Simple Randomized Parallel Algorithm for Maximal f-Matchings. Inf. Process. Lett. Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
1996	—	`conf`	Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
1996	J	`jnl`	Parallel Tree-Contraction and Fibonacci Numbers. Inf. Process. Lett. Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
1996	B	`conf`	Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). CPM Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
1996	A*	`conf`	Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. SODA Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
1995	B	`conf`	Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. CPM Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
1995	J	`jnl`	Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm. Theor. Comput. Sci. Wojciech Rytter
1995	B	`conf`	On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. LATIN Maxime Crochemore, Wojciech Rytter
1995	J	`jnl`	Pattern-Matching for Strings with Short Descriptions Electron. Colloquium Comput. Complex. Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
1995	B	`conf`	Pattern-Matching for Strings with Short Descriptions. CPM Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
1995	J	`jnl`	Polynomial Size Test Sets for Context-Free Languages. J. Comput. Syst. Sci. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1995	J	`jnl`	Squares, Cubes, and Time-Space Efficient String Searching. Algorithmica Maxime Crochemore, Wojciech Rytter
1995	J	`jnl`	The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. Theor. Comput. Sci. Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
1995	A	`conf`	Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
1994	B	`conf`	An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern. CPM Marek Karpinski, Wojciech Rytter
1994	J	`jnl`	An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. Inf. Process. Lett. Lawrence L. Larmore, Wojciech Rytter
1994	J	`jnl`	Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. Theor. Comput. Sci. Burkhard Monien, Wojciech Rytter, Helmut Schäpers
1994	J	`jnl`	On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. Theor. Comput. Sci. Maxime Crochemore, Wojciech Rytter
1994	B	`conf`	On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. MFCS Marek Karpinski, Wojciech Rytter
1994	—	`conf`	Parallel and Sequential Approximations of Shortest Superstrings. SWAT Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
1994	J	`jnl`	Speeding Up Two String-Matching Algorithms. Algorithmica Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
1994	—	`book`	Text Algorithms Maxime Crochemore, Wojciech Rytter
1994	J	`jnl`	Two Results on Linear Embeddings of Complete Binary Trees. Theor. Comput. Sci. Marek Chrobak, Wojciech Rytter
1993	J	`jnl`	Efficient constructions of test sets for regular and context-free languages. Theor. Comput. Sci. Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek
1993	J	`jnl`	Fast recognition of deterministic cfl's with a smaller number of processors. Theor. Comput. Sci. Burkhard Monien, Wojciech Rytter, Leopold Schäpers
1993	A*	`conf`	Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions FOCS Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
1993	B	`conf`	Parallel Construction of Optimal Alphabetic Trees. SPAA Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter
1993	J	`jnl`	Two-Dimensional Pattern Matching by Sampling. Inf. Process. Lett. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
1992	B	`conf`	A Simple Randomized Parallel Algorithm for Maximal LATIN Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
1992	A	`conf`	Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. STACS Lawrence L. Larmore, Wojciech Rytter
1992	—	`conf`	Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. ICPIA Maxime Crochemore, Wojciech Rytter
1992	J	`jnl`	Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. Inf. Process. Lett. Peter Rossmanith, Wojciech Rytter
1992	J	`jnl`	On Parallel Recognition of Two Classes of 2-D Array Patterns. Int. J. Pattern Recognit. Artif. Intell. Wojciech Rytter, Ahmed Saoudi
1992	B	`conf`	Parallel Recognition and Ranking of Context-Free Languages. MFCS Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
1992	—	`conf`	Parallel algorithms for 2D-image recognition. ICPR (4) Wojciech Rytter, Ahmed Saoudi
1992	A*	`conf`	Polynomial Size Test Sets for Context-Free Languages. ICALP Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1992	A	`conf`	Speeding Up Two String-Matching Algorithms. STACS Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter
1991	—	`book`	Analysis of algorithms and data structures. Lech Banachowski, Antoni Kreczmar, Wojciech Rytter
1991	B	`conf`	Efficient Constructions of Test Sets for Regular and Context-Free Languages. MFCS Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek
1991	J	`jnl`	Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. Inf. Process. Lett. Maxime Crochemore, Wojciech Rytter
1991	B	`conf`	Exact Analysis of Three Tree Contraction Algorithms. FCT Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
1991	J	`jnl`	On Optimal Parallel Computations for Sequences of Brackets. Theor. Comput. Sci. Krzysztof Diks, Wojciech Rytter
1991	J	`jnl`	On the Complexity of the Recognition of Parallel 2D-Image Languages. Inf. Process. Lett. Wojciech Rytter, Ahmed Saoudi
1991	J	`jnl`	On the Parallel Recognition of Unambiguous Context-Free Languages. Theor. Comput. Sci. Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter
1991	J	`jnl`	Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. Theor. Comput. Sci. Maxime Crochemore, Wojciech Rytter
1990	—	`conf`	Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
1990	J	`jnl`	Optimally Edge-Colouring Outerplanar Graphs is in NC. Theor. Comput. Sci. Alan Gibbons, Wojciech Rytter
1990	A	`conf`	Parallel Computations on Strings and Arrays. STACS Maxime Crochemore, Wojciech Rytter
1990	B	`conf`	Parallel Construction of Minimal Suffix and Factor Automata. MFCS Maxime Crochemore, Wojciech Rytter
1990	J	`jnl`	Parallel Construction of Minimal Suffix and Factor Automata. Inf. Process. Lett. Maxime Crochemore, Wojciech Rytter
1989	J	`jnl`	A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. Inf. Process. Lett. Wojciech Rytter
1989	J	`jnl`	Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition Inf. Comput. Alan Gibbons, Wojciech Rytter
1989	B	`conf`	Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). MFCS Krzysztof Diks, Torben Hagerup, Wojciech Rytter
1989	—	`conf`	Optimal Parallel Computations for Halin Graphs. Optimal Algorithms Krzysztof Diks, Wojciech Rytter
1989	J	`jnl`	Parallel Algorithms for a Class of Graphs Generated Recursively. Inf. Process. Lett. Wojciech Rytter, Tomasz Szymacha
1989	B	`conf`	Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). MFCS Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha
1988	—	`book`	Efficient parallel algorithms. Alan Gibbons, Wojciech Rytter
1988	J	`jnl`	On Efficient Computations of Costs of Paths on a Grid Graph. Inf. Process. Lett. Wojciech Rytter
1988	J	`jnl`	On Efficient Parallel Computations for some Dynamic Programming Problems. Theor. Comput. Sci. Wojciech Rytter
1988	J	`jnl`	Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs. Inf. Process. Lett. Alan Gibbons, Amos Israeli, Wojciech Rytter
1987	—	`conf`	A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. Parallel Algorithms and Architectures Wojciech Rytter
1987	B	`conf`	Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. FCT Alan Gibbons, Wojciech Rytter
1987	—	`conf`	Optimal Parallel Parsing of Bracket Languages. Parallel Algorithms and Architectures Wojciech Rytter, Raffaele Giancarlo
1987	J	`jnl`	Optimal Parallel Parsing of Bracket Languages. Theor. Comput. Sci. Wojciech Rytter, Raffaele Giancarlo
1987	J	`jnl`	Parallel Time O(log n) Recognition of Unambiguous Context-free Languages Inf. Comput. Wojciech Rytter
1987	J	`jnl`	Remarks on String-Matching and One-Way Multihead Automata. Inf. Process. Lett. Marek Chrobak, Wojciech Rytter
1986	J	`jnl`	An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages. Inf. Process. Lett. Wojciech Rytter
1986	—	`conf`	An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. FSTTCS Alan Gibbons, Wojciech Rytter
1986	J	`jnl`	On the Complexity of Parallel Parsing of General Context-Free Languages. Theor. Comput. Sci. Wojciech Rytter
1986	J	`jnl`	On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci. Alan Gibbons, Wojciech Rytter
1986	J	`jnl`	The Space Complexity of the Unique Decipherability Problem. Inf. Process. Lett. Wojciech Rytter
1986	B	`conf`	Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). MFCS Marek Chrobak, Wojciech Rytter
1985	J	`jnl`	A Characterization of Reversal-Bounded Multipushdown Machine Languages. Theor. Comput. Sci. Wojciech Rytter, Marek Chrobak
1985	J	`jnl`	Fast Recognition of Pushdown Automaton and Context-free Languages Inf. Control. Wojciech Rytter
1985	B	`conf`	Parallel time O(log n) recognition of unambiguous CFLs. FCT Wojciech Rytter
1984	B	`conf`	Fast Recognition of Pushdown Automaton and Context-Free Languages. MFCS Wojciech Rytter
1984	J	`jnl`	On Linear Context-Free Languages and One-Way Multihead Automata. Inf. Process. Lett. Wojciech Rytter
1984	—	`conf`	On the recognition of context-free languages. Symposium on Computation Theory Wojciech Rytter
1983	J	`jnl`	A Simulation Result for Two-Way Pushdown Automata. Inf. Process. Lett. Wojciech Rytter
1983	—	`conf`	Remarks on the Pyramidal Structure. CAAP Wojciech Rytter
1983	J	`jnl`	Time Complexity of Loop-Free Two-Way Pushdown Automata. Inf. Process. Lett. Wojciech Rytter
1982	J	`jnl`	A Note on Two-Way Nondeterministic Pushdown Automata. Inf. Process. Lett. Wojciech Rytter
1982	J	`jnl`	Time Complexity of Unambiguous Path Systems. Inf. Process. Lett. Wojciech Rytter
1981	J	`jnl`	A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata. Inf. Process. Lett. Wojciech Rytter
1981	J	`jnl`	An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads. Inf. Process. Lett. Wojciech Rytter
1981	J	`jnl`	The Dynamic Simulation of Recursive and Stack Manipulation Programs. Inf. Process. Lett. Wojciech Rytter
1981	J	`jnl`	Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata. Inf. Process. Lett. Wojciech Rytter
1980	J	`jnl`	A Correct Preprocessing Algorithm for Boyer-Moore String-Searching. SIAM J. Comput. Wojciech Rytter
1980	J	`jnl`	Functional Automata. Fundam. Informaticae Wojciech Rytter
1974	J	`jnl`	The Dimension of Stability of Stochastic Automata Inf. Control. Wojciech Rytter
1973	J	`jnl`	The Dimension of Strong Stability of Minimal State Stochastic Automata. Bull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys. Wojciech Rytter
1973	J	`jnl`	The Strong Stability Problem for Stochastic Automata. Bull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys. Wojciech Rytter