-
The dimension of stability of stochastic automata,
Information
and Control 24:3 (1974)
-
A correct preprocessing algorithm of Boyer-Moore
string searching, SIAM
Journal on Computing 9 (1980), 509-512
-
A note on traversing a labirinth
paper in Graph Theory 1981, Lecture Notes in Mathematics volume 1018
-
Remarks on the pyramidal structure
,
paper in CAAP 1984
-
Fast recognition of pushdown automaton and context-free
lanaguages, Information and Control 67 (1985),12-22
-
Parallel time O(log n) recognition of unambiguous
cfl's, Information and
Computation 73:1 (1987) 75-86
-
Optimal parallel algorithms for dynamic expression
evaluation and applications to context-free languages (with A.M.Gibbons),
Information and Computation (1989)
-
Lawrence L. Larmore and Wojciech Rytter.
Almost
optimal sublinear time parallel recognition algorithms for three subclasses
of context free languages. Theoretical Computer Science, 197(1-2):189-201,
1998
-
M. Karpinski, L. Larmore, W. Rytter,
Correctnes
of Hu-Tucker algorithm revisited, Theoretical Computer Science 1997
-
Speeding up two string matching algorithms,
Algorithmica 12 (1994) (with A.
Czumaj and others)
-
Cubes, squares and time space efficient string matching,
(with M.Crochemore) Algorithmica 13,5 (1995) 405-425
-
M. Chrobak, W.Rytter,
Embedding trees into lines,
Theoretical
Computer Science 136 (1994)
-
Polynomial size test sets for context-free languages",
in: Proc. of Conf. on Automata, Languages and Programming, ICALP'92, LNCS
623,
Springer-Verlag, 1992, pp. 53-64 (co-authors: J.Karhumäki
,
W.Plandowski
)
final version in Journal
of Computer and System Sciences 1995.
-
(with W.Plandowski, T.Szymacha) Tree
contraction and Fibonacci numbers, Information
Processing letters 1995.
-
W. Rytter Context-free
recognition via shortest path computation: a version of Valiant's algorithm,
Theoretical
Computer Science
-
(with M. Crochemore) Two
dimensional pattern matching in linear time and small space, STACS'95,
Lecture Notes in Computer Science
-
(with , R. Cole , Z.
Galil , K. Park , S.
Muthukrishnan and others) Parallel
one and two-dimensional preprocessing and pattern matching, in
FOCS 1993
-
Parallel
construction of alphabetic trees (with L.
Larmore and T. Przytycka), in SPAA'93.
-
M. Karpinski, W. Rytter, A. Shinohara, Pattern-matching
for strings with short description Nordic Journal of Computing, 4(2):172-186
-
L. Gasieniec, W. Plandowski, W.Rytter, The
zooming method: a recursive approach to time-space efficient string-matching,
Theoretical Computer Science, vol.147 (1995)
-
L. Gasieniec, W. Plandowski, W.Rytter, Constant-space
string matching with smaller number of comparisons: sequential sampling,
CPM 1995
-
(with L.Gasieniec, M.Karpinksi, W.Plandowski) Efficient
algorithms for Lempel-Ziv encodings, SWAT'96, Lecture Notes
in Comp. Science, Springer Verlag 1996
-
(with L. Larmore and M. Karpinski) Sequential and
parallel subquadratic work constructions of approximately optimal binary
search trees, the 7th ACM Symposium on Discrete Algorithms, SODA'96
-
(with M. Karpinski)
Alphabet
Independent Optimal Parallel Search for Three-Dimensional Patterns,
Theoretical Computer Science 1998
-
-
(with A. Czumaj,
L. Gasieniec
,
M.
Piotrow ), Parallel and sequential complexity
of the shortest superstring problem, Journal
of Algorithms Vol. 23, No. 1, pages 74-100, July 1997
preliminary
version in SWAT'94
-
Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, and Wojciech
Rytter. Constant-time
randomized parallel string matching. SIAM
Journal on Computing , 26(4):950-960, August 1997
-
W. Plandowski, W. Rytter, Application
of LZ encodings to word equations, ICALP'98
-
L. Gasieniec, W. Rytter, Fully
compressed pattern-matching for LZW encoding, IEEE Data Compression
Conf. 1999
-
A. Czumaj, I.FInch, L.Gasieniec, A.Gibbons, P.Leng, W. Rytter, M.Zito,
Efficient
web searching using temporal factors WADS'99
-
L.Gasieniec, A.Gibbons, W. Rytter, The
parallel complexity of pattern-searching in highly compressed texts, in
MFCS'99
-
J. Karhumaki, W. Plandowski, W.Rytter, The
compression of subegments of compressed images, Combinatorial Pattern
Matching 1999, to appear in Discrete Applied Mathematics 2003
-
W.Rytter,
Compressed and fully compressed pattern matching,
Proceedings of IEEE,
November 2000, Volume 88, Number 11, pp. 1769-1778
-
B. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, W. Ryter, Deterministic
broadcasting in unknown radio networks, in SODA'2000
-
P. Bradford, M. Golin, L. Larmore, W. Rytter,
Efficient
algorithms for prefix free codes,
Journal of Algorithms Vol. 42, No. 2, February 2002, p. 277-303
-
M.Chrobak, L. Gasieniec, W. Rytter,
Fast broadcasting and gossiping in radio networks,
Journal of Algorithms 43(2): 177-189 (2002),
(preliminary version in FOCS 2000)
-
P.Berman, M. Karpinski, L.Larmore, W.Plandowski, W.Rytter,
On the Complexity of Pattern Matching for Highly Compressed
Two-Dimensional Texts ,
Journal of Computer and System Sciences, September 2002
-
W. Rytter,
Faster algorithms for k-medians in trees ,
MFCS 2003
-
A.Czumaj, W. Rytter,
Broadcasting algorithms in radio networks
IEEE Foundation of Computer Science, FOCS 2003, 492-501
-
W. Rytter,
Application of LZ factorization to the the approximation of grammar based
compression,
Combinatorial Pattern Matching, June 2002
Full version: TCS 1-3(299): 763-774 (2003)
-
W. Rytter,
On maximal suffixes, constant-space linear-time versions of KMP algorithm.
Theor. Comput. Sci. 1-3(299): 763-774 (2003),
-
W. Rytter,
Grammar compression, LZ-encodings and problems on compressed strings,
slides in ps
ICALP 2004
-
W. Rytter,
Binary trees with minimum total path length, in
Handbook of Data Structures and Applications, Dinesh Mehta, Sartaj Sahni,
CRC Press 2004
-
F. Bastien, R. Czyzowicz, W. Fraczak, W. Rytter,
Decomposition and equivalence of simple languages,
in ps ,
CIAA 2005
-
W. Rytter,
The structure of subword graphs and Fibonacci trees of Fibonacci words, the paper
in ps and slides
in ps
- S. Lasota, W. Rytter,
Faster Algorithm for
Bisimulation Equivalence of Normed Context-Free Processes, in ps ,
MFCS 2006
- W. Rytter,
The number of runs in the string,
in ps ,
Information and Computation 2007
- P. Baturo, W. Rytter,
Occurrence and Lex. Properties of Sturmian Words
in pdf ,
LATA 2007
- J. Karhumaki, W. Rytter, Yury Lifshits,
Tiling periodicty,
in ps , CPM 2007
- W. Rytter, London Stringolgy Day 2008
, in postscrit
and
in pdf
- Konwersatorium:
Algorithmic stories (in polish)
in pdf , May 2008
-
W.Plandowski, W.Rytter,
Language recognition problems in compressed words
in ps
-
F. Coenen , P. Leng , A. Pagourtzis , W. Rytter , D. Souliou,
Improved methods for extracting frequent itemsets from
interim-support trees, Software: Practice and Experience Volume 39 Issue 6, Pages 551 - 571, 2009,
in pdf
-
M. Piatkowski, W.Rytter, Subword graphs of Sturmian words,
PSC 2008
in pdf
- M. Piatkowski, W. Rytter,
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words, PSC 2009
in ps
-
M. Crochemore, L.Ilie, M.Kubica, W. Rytter, T.Walen,
LPF computation revisited
in pdf , IWOCA 2009
- Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen,
On the Maximal Number of Cubic Subwords in a String,
in pdf , IWOCA 2009
-
P.Baturo, W.Rytter,
Compressed string matching in Sturmian words,
TCS 2009
in pdf
-
M. Crochemore, L.Ilie, W.Rytter,
Repetitions in words: algorithms and combinatorics (to appear)
in pdf
-
W.Rytter,
Several combinatorial facts about squares, cubes and long runs. LSD 2010
in pdf
-
B.Klunder, W.Rytter,
Post correspondence problem with p.c. alphabets, LATA 2010,
in pdf
-
J. Radoszewski, W.Rytter,
Subword graphs for Thue-Morse words, Polish Conference in Combinatorics, 2010,
slides in pdf and
paper in pdf
-
Applications of runs, SPIRE 2010
in pdf
-
Sums of exponents of runs, IWOCA 2010
in pdf
-
Computing tables LPrF, SOFSEM 2010
in pdf
-
J. Radoszewski, W.Rytter,
Efficient testing of equivalence of words, SOFSEM 2010
in pdf
-
Simple algorithms for squares and runs, PSC 2010
in pdf
-
Cubic runs, LATA 2010
in pdf
-
W. Rytter and Many Others, Maximum number of squares in trees
in pdf , London Stringology Days 2012, also presented at CPM 2012
-
W. Rytter, B. Szreder,
Maximum Hamiltonian Paths in Complete Graphs with Tree Metric,
in pdf , FUN 2012
-
T. Kociumaka, M.Kubica, J.Radoszewski, W. Rytter, W.Tyczynski, T.Walen,
Linear time computation of minimal seeds, SODA 2012
in pdf
-
Z.Adamczyk, W. Rytter, A note on simple computation of maximal suffixes, JDA 2013
in pdf
-
W. Rytter, Liczenie podzialow liczb - algorytm Eulera,
in pdf
, wyklad na ONTAK 2012
-
The Number of Runs in Sturmian words, Electronic Journal of Combinatorics 20(1) 2013
slides in pdf , the paper in pdf ,
-
Constructing binary words with a given set of periods, LSD 2014
slides in pdf
-
Nonstandard squares in strings, Dagstuhl 2014
slides in pdf