- Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses
- automata-theoretic deterministic
- Almost optimal fully LZW-compressed pattern Leszek G asieniec Wojciech Rytter y
- Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
- The structure of subword graphs and sux trees of Fibonacci words
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression
- Complexity of Language Recognition Problems for Compressed Words
- Extracting Powers and Periods in a String from its Runs Structure
- LPF computation revisited Maxime Crochemore1,4
- Compressed and Fully Compressed Pattern-Matching in One and Two Dimensions Wojciech Rytter
- Nordic Journal of Computing AN EFFICIENT PATTERNMATCHING ALGORITHM
- Parallel and Sequential Approximation of Shortest Superstrings
- The Number of Runs in a String Wojciech Rytter
- Optimal PrefixFree Codes for Unequal Letter Costs and Dynamic Programming with the Monge Property
- Faster Algorithms for k-Median Problems in Robert Benkoczi 1 , Binay Bhattacharya 1 , Marek Chrobak 2 , Lawrence L.
- Application of LempelZiv Encodings to the Solution of Word Equations
- Deterministic broadcasting in unknown radio networks Bogdan S. Chlebus Leszek G asieniec yx Alan Gibbons y Andrzej Pelc z
- SOFTWARE--PRACTICE AND EXPERIENCE Softw. Pract. Exper. 2009; 39:551571
- Correctness of Constructing Optimal Alphabetic Trees Revisited
- SIAM J. COMPUT. c fl1993 Society for Industrial and Applied Mathematics
- Tiling Periodicity Juhani Karhumaki, Turku University, Finland
- Constant-space string matching with smaller number of comparisons: sequential sampling.
- Wojciech Rytter Runs in Sturmian Words The Number of Runs in Sturmian Words
- Contextfree recognition via shortest paths computation: a version of Valiant's algorithm
- The Complexity of Compressing Subsegments of Images Described by Finite Automata
- Mohammadreza corresponding
- On Maximal Suxes and Constant-Space Linear-Time Versions of KMP Algorithm
- Several combinatorial facts about squares, cubes and long runs
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Compressed String Matching in Standard Sturmian Words 1
- Repetitions in strings: algorithms and combinatorics
- The structure of graphs representing all subwords of Thue-Morse sequences
- On the Structure of Compacted Subword Graphs of Thue-Morse Words and Their Applications
- On the Maximal Sum of Exponents of Runs in a String Maxime Crochemorea,c
- Elsevier Editorial System(tm) for Journal of Discrete Algorithms Manuscript Draft
- Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup
- New Simple Efficient Algorithms Computing Powers and Runs in Strings
- The Maximal Number of Cubic Runs in a String M. Crochemorea,b
- The number of runs in Sturmian words Pawel Baturo1
- Prime Normal Form and Equivalence of Simple Grammars C edric Bastien 1 , Jurek Czyzowicz 1 , Wojciech Fraczak 1;2 , and Wojciech Rytter 3
- Alphabet Independent Optimal Parallel Search for Three-Dimensional Patterns
- Fast Broadcasting and Gossiping in Radio Networks Marek Chrobak Leszek G asieniec y Wojciech Rytter z
- Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words
- Parallel TreeContraction and Fibonacci Numbers \Lambda Wojciech Plandowski Wojciech Rytter Tomasz Szymacha
- On the Maximal Number of Cubic Subwords in a String
- Recovering the `tree. It does not suffice to know the value of fi
- On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts 1
- Compression, LZ-encodings
- Hamiltonian paths in the square of a tree Jakub Radoszewski1
- Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric
- Tiling Periodicity Juhani Karhumaki, Turku University, Finland
