| Text algorithms M Crochemore, W Rytter Maxime Crochemore, 1994 | 1094 | 1994 |
| Efficient parallel algorithms A Gibbons, W Rytter Cambridge University Press, 1989 | 854 | 1989 |
| Jewels of stringology: text algorithms M Crochemore, W Rytter World Scientific, 2002 | 584 | 2002 |
| Application of Lempel–Ziv factorization to the approximation of grammar-based compression W Rytter Theoretical Computer Science 302 (1-3), 211-222, 2003 | 358 | 2003 |
| Fast broadcasting and gossiping in radio networks M Chrobak, L Gasieniec, W Rytter Journal of Algorithms 43 (2), 177-189, 2002 | 331 | 2002 |
| Deterministic broadcasting in ad hoc radio networks BS Chlebus, L Gasieniec, A Gibbons, A Pelc, W Rytter Distributed computing 15 (1), 27-38, 2002 | 317 | 2002 |
| Speeding up two string-matching algorithms M Crochemore, A Czumaj, L Gasieniec, S Jarominek, T Lecroq, ... Algorithmica 12, 247-267, 1994 | 267 | 1994 |
| Broadcasting algorithms in radio networks with unknown topology A Czumaj, W Rytter Journal of Algorithms 60 (2), 115-143, 2006 | 264 | 2006 |
| Squares, cubes, and time-space efficient string searching M Crochemore, W Rytter Algorithmica 13, 405-425, 1995 | 166 | 1995 |
| Efficient algorithms for Lempel-Ziv encoding L Gasieniec, M Karpinski, W Plandowski, W Rytter Algorithm Theory—SWAT'96: 5th Scandinavian Workshop on Algorithm Theory …, 1996 | 140 | 1996 |
| A linear time algorithm for consecutive permutation pattern matching M Kubica, T Kulczyński, J Radoszewski, W Rytter, T Waleń Information Processing Letters 113 (12), 430-433, 2013 | 124 | 2013 |
| Fast parallel algorithms for graph matching problems M Karpiński, W Rytter Oxford University Press, 1998 | 110 | 1998 |
| On efficient parallel computations for some dynamic programming problems W Rytter Theoretical Computer Science 59 (3), 297-307, 1988 | 110 | 1988 |
| An efficient pattern-matching algorithm for strings with short descriptions M Karpinski, W Rytter, A Shinohara Nord. J. Comput. 4 (2), 172-186, 1997 | 109 | 1997 |
| Application of Lempel-Ziv encodings to the solution of word equations W Plandowski, W Rytter International Colloquium on Automata, Languages, and Programming, 731-742, 1998 | 99 | 1998 |
| Fast practical multi-pattern matching M Crochemore, A Czumaj, L Gasieniec, T Lecroq, W Plandowski, W Rytter Information Processing Letters 71 (3-4), 107-113, 1999 | 98 | 1999 |
| The number of runs in a string: Improved analysis of the linear upper bound W Rytter STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006 | 91 | 2006 |
| Internal pattern matching queries in a text and applications T Kociumaka, J Radoszewski, W Rytter, T Waleń Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 90 | 2014 |
| Algorytmy i struktury danych: skrypt dla studentów informatyki L Banachowski, K Diks, W Rytter Wydawnictwa Uniwersytetu Warszawskiego, 1992 | 88 | 1992 |
| A correct preprocessing algorithm for Boyer–Moore string-searching W Rytter SIAM Journal on Computing 9 (3), 509-512, 1980 | 83 | 1980 |
Maxime CrochemoreKCL在 kcl.ac.uk 的电子邮件经过验证
