| ||
| 26. | The number of runs in a string: improved analysis of the linear upper bound
INFORMATION AND COMPUTATION Tom 205 Nr 9 r. 2007, str. 1459-1469 (Artykuł) Wojciech Rytter | |
| 27. | Tiling Periodicity
LECTURE NOTES IN COMPUTER SCIENCE Tom 4580 r. 2007, str. 295-306 (Artykuł konferencyjny) Juhani Karhumaki, Yury Lifshits, Wojciech Rytter | |
| 28. | Broadcasting algorithms in radio networks with unknown topology
JOURNAL OF ALGORITHMS Tom 60 Nr 2 r. 2006, str. 115-143 (Artykuł) Artur Czumaj, Wojciech Rytter | |
| 29. | Equivalence of Functions Represented by Simple Context-Free Grammars with Output
LECTURE NOTES IN COMPUTER SCIENCE Tom 4036 r. 2006, str. 71-82 (Artykuł konferencyjny) Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter | |
| 30. | Faster algorithm for bisimulation equivalence of normed context-free processes
LECTURE NOTES IN COMPUTER SCIENCE Tom 4162 r. 2006, str. 646-657 (Artykuł konferencyjny) Sławomir Lasota, Wojciech Rytter | |
| 31. | Prime normal form and equivalence of simple grammars
THEORETICAL COMPUTER SCIENCE Tom 363 Nr 2 r. 2006, str. 124-134 (Artykuł) Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter | |
| 32. | Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice
LECTURE NOTES IN COMPUTER SCIENCE Tom 4094 r. 2006, str. 90-101 (Artykuł konferencyjny) Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter | |
| 33. | The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
LECTURE NOTES IN COMPUTER SCIENCE Tom 3884 r. 2006, str. 184-195 (Artykuł konferencyjny) Wojciech Rytter | |
| 34. | The structure of subword graphs and suffix trees of Fibonacci words
THEORETICAL COMPUTER SCIENCE Tom 363 r. 2006, str. 211-223 (Artykuł) Wojciech Rytter | |
| 35. | A first approach to finding common motifs with gaps
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE Tom 16 Nr 6 r. 2005, str. 1145-1155 (Artykuł) Costas Iliopoulos, James MCHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot | |
| 36. | On the complexity of decidable cases of the commutation problem of languages
THEORETICAL COMPUTER SCIENCE Tom 337 r. 2005, str. 105-118 (Artykuł) Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter | |
| 37. | A randomized algorithm for gossiping in radio networks
NETWORKS Tom 43 Nr 2 r. 2004, str. 119-124 (Artykuł) Marek Chrobak, Leszek Gasieniec, Wojciech Rytter | |
| 38. | Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input
LECTURE NOTES IN COMPUTER SCIENCE Tom 3142 r. 2004, str. 15-27 (Artykuł konferencyjny) Wojciech Rytter | |
| 39. | Application of Lempel-Ziv factorization to the approximation of grammar-based compression
THEORETICAL COMPUTER SCIENCE Tom 299 r. 2003, str. 763-774 (Artykuł) Wojciech Rytter | |
| 40. | Broadcasting algorithms in radio networks
ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) Tom 44 r. 2003, str. 492-501 (Artykuł konferencyjny) Artur Czumaj, Wojciech Rytter | |
| 41. | Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
COMPUTER JOURNAL Tom 46 Nr 4 r. 2003, str. 391-400 (Artykuł) Aala Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter | |
| 42. | Faster algorithms for k-medians in trees
LECTURE NOTES IN COMPUTER SCIENCE Tom 2747 r. 2003, str. 218-227 (Artykuł konferencyjny) Robert Benkoci, Marek Chrobak, Lawrence Larmore, Wojciech Rytter | |
| 43. | Occurrence and substring heuristics for delta-matching
FUNDAMENTA INFORMATICAE Tom 56 Nr 1 r. 2003, str. 1-21 (Artykuł) Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski, Wojciech Rytter | |
| 44. | On maximal suffices and constant space versions of KMP algorithm
THEORETICAL COMPUTER SCIENCE Tom 302 r. 2003, str. 211-222 (Artykuł) Wojciech Rytter | |
| 45. | On polynomial-time approximation algorithms for the variable length scheduling problem
THEORETICAL COMPUTER SCIENCE Tom 302 r. 2003, str. 489-495 (Artykuł) Artur Czumaj, Leszek Gasieniec, Daya Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito | |
| 46. | Relations between delta-matching and matching with don
INFORMATION PROCESSING LETTERS Tom 85 Nr 5 r. 2003, str. 227-233 (Artykuł) Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter | |
| 47. | The complexity of compressing subsegments of images described by finite automata
DISCRETE APPLIED MATHEMATICS Tom 125 r. 2003, str. 235-254 (Artykuł) Juhani Karhumaeki, Wojciech Plandowski, Wojciech Rytter | |
| 48. | Application of Lempel-Ziv factorization to the approximation of grammar-based compression
LECTURE NOTES IN COMPUTER SCIENCE Tom 2373 r. 2002, str. 20-31 (Artykuł konferencyjny) Wojciech Rytter | |
| 49. | Approximate string matching with gaps
NORDIC JOURNAL OF COMPUTING Tom 9 r. 2002, str. 54-65 (Artykuł) Maxime Crochemore, C. Iliopoulos, C. Makris, Wojciech Rytter, A. Tsakalidis, K. Tsichlas | |
| 50. | Deterministic broadcasting in ad hoc radio networks
DISTRIBUTED COMPUTING Tom 15 r. 2002, str. 27-38 (Artykuł) Bogdan Chlebus, Leszek Gasieniec, Alan Gibbons, Wojciech Rytter, Andrzej Pelc | |