Text algorithms M Crochemore, W Rytter Maxime Crochemore, 1994 | 987 | 1994 |

Efficient parallel algorithms A Gibbons, W Rytter Cambridge University Press, 1989 | 773 | 1989 |

Jewels of stringology: text algorithms M Crochemore, W Rytter World Scientific, 2002 | 516 | 2002 |

Fast broadcasting and gossiping in radio networks M Chrobak, L Gasieniec, W Rytter Proceedings 41st Annual Symposium on Foundations of Computer Science, 575-581, 2000 | 294 | 2000 |

Deterministic broadcasting in ad hoc radio networks BS Chlebus, L Gasieniec, A Gibbons, A Pelc, W Rytter Distributed computing 15 (1), 27-38, 2002 | 289 | 2002 |

Application of Lempel–Ziv factorization to the approximation of grammar-based compression W Rytter Theoretical Computer Science 302 (1-3), 211-222, 2003 | 279 | 2003 |

Speeding up two string-matching algorithms M Crochemore, A Czumaj, L Gasieniec, S Jarominek, T Lecroq, ... Algorithmica 12 (4-5), 247-267, 1994 | 271 | 1994 |

Handbook of data structures and applications DP Mehta, S Sahni Chapman and Hall/CRC, 2004 | 259 | 2004 |

Broadcasting algorithms in radio networks with unknown topology A Czumaj, W Rytter 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 249 | 2003 |

Wprowadzenie do algorytmĂłw TH Cormen, CE Leiserson, RL Rivest, C Stein, K Diks, A Malinowski, ... Wydawnictwo Naukowe PWN, 2012 | 239 | 2012 |

Squares, cubes, and time-space efficient string searching M Crochemore, W Rytter Algorithmica 13 (5), 405-425, 1995 | 136 | 1995 |

Efficient algorithms for Lempel-Ziv encoding L Gasieniec, M Karpinski, W Plandowski, W Rytter Scandinavian Workshop on Algorithm Theory, 392-403, 1996 | 123 | 1996 |

An efficient pattern-matching algorithm for strings with short descriptions M Karpinski, W Rytter, A Shinohara Nord. J. Comput. 4 (2), 172-186, 1997 | 100 | 1997 |

Fast parallel algorithms for graph matching problems M Karpiński, M Karpinski, W Rytter Oxford University Press, 1998 | 96 | 1998 |

On efficient parallel computations for some dynamic programming problems W Rytter Theoretical Computer Science 59 (3), 297-307, 1988 | 88 | 1988 |

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 | 85 | 1999 |

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 | 81 | 1998 |

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 | 79 | 2013 |

The number of runs in a string: Improved analysis of the linear upper bound W Rytter Annual Symposium on Theoretical Aspects of Computer Science, 184-195, 2006 | 78 | 2006 |

Algorytmy i struktury danych: skrypt dla studentów informatyki L Banachowski, K Diks, W Rytter Wydawnictwa Uniwersytetu Warszawskiego, 1992 | 74 | 1992 |