Abelian complexity of minimal subshifts G Richomme, K Saari, LQ Zamboni Journal of the London Mathematical Society 83 (1), 79-95, 2010 | 85 | 2010 |

Balance and Abelian complexity of the Tribonacci word G Richomme, K Saari, LQ Zamboni Advances in Applied Mathematics 45 (2), 212-231, 2010 | 43 | 2010 |

Know your phish: Novel techniques for detecting phishing sites and their targets S Marchal, K Saari, N Singh, N Asokan 2016 IEEE 36th International Conference on Distributed Computing Systems …, 2016 | 38 | 2016 |

Avoiding Abelian powers in binary words with bounded Abelian complexity J Cassaigne, G Richomme, K Saari, LQ Zamboni International Journal of Foundations of Computer Science 22 (04), 905-920, 2011 | 38 | 2011 |

Least periods of factors of infinite words JD Currie, K Saari RAIRO-Theoretical Informatics and Applications 43 (1), 165-178, 2009 | 26 | 2009 |

Local squares, periodicity and finite automata M Huova, J Karhumäki, A Saarela, K Saari Rainbow of computer science, 90-101, 2011 | 18 | 2011 |

Off-the-hook: An efficient and usable client-side phishing prevention application S Marchal, G Armano, T Gröndahl, K Saari, N Singh, N Asokan IEEE Transactions on Computers 66 (10), 1717-1733, 2017 | 17 | 2017 |

On the frequency of letters in morphic sequences K Saari International Computer Science Symposium in Russia, 334-345, 2006 | 16 | 2006 |

Lyndon words and Fibonacci numbers K Saari Journal of Combinatorial Theory, Series A 121, 34-44, 2014 | 13 | 2014 |

On the frequency and periodicity of infinite words K Saari Turku Centre for Computer Science, 2008 | 13 | 2008 |

On highly palindromic words Š Holub, K Saari Discrete Applied Mathematics 157 (5), 953-959, 2009 | 10 | 2009 |

Everywhere *α*-Repetitive Sequences and Sturmian WordsK Saari International Computer Science Symposium in Russia, 362-372, 2007 | 10 | 2007 |

Everywhere α-repetitive sequences and Sturmian words K Saari European Journal of Combinatorics 31 (1), 177-192, 2010 | 9 | 2010 |

Primitive words and Lyndon words in automatic and linearly recurrent sequences D Goč, K Saari, J Shallit International Conference on Language and Automata Theory and Applications …, 2013 | 7 | 2013 |

On the frequency of letters in pure binary morphic sequences K Saari International Conference on Developments in Language Theory, 397-408, 2005 | 6 | 2005 |

Local squares, periodicity and finite automata, Rainbow of computer science: dedicated to Hermann Maurer on the occasion of his 70th birthday M Huova, J Karhumäki, A Saarela, K Saari Springer-Verlag, Berlin, Heidelberg, 2011 | 5 | 2011 |

Transposition invariant words A Lepistö, F Pappalardi, K Saari Theoretical computer science 380 (3), 377-387, 2007 | 5 | 2007 |

Periods of factors of the Fibonacci word K Saari Proceedings of the Sixth International Conference on Words (WORDS’07), 273-279, 2007 | 5 | 2007 |

Extremal words in morphic subshifts JD Currie, N Rampersad, K Saari, LQ Zamboni Discrete Mathematics 322, 53-60, 2014 | 4 | 2014 |

Square-free words with square-free self-shuffles JD Currie, K Saari The Electronic Journal of Combinatorics, 2014 | 4 | 2014 |