| Enumeration of factors in the Thue-Morse word S Brlek Discrete Applied Mathematics 24 (1-3), 83-96, 1989 | 178 | 1989 |
| On the palindromic complexity of infinite words S Brlek, S Hamel, M Nivat, C Reutenauer International Journal of Foundations of Computer Science 15 (02), 293-306, 2004 | 107 | 2004 |
| Lyndon+ Christoffel= digitally convex S Brlek, JO Lachaud, X Provençal, C Reutenauer Pattern Recognition 42 (10), 2239-2246, 2009 | 69 | 2009 |
| Addition chains using continued fractions F Bergeron, J Berstel, S Brlek, C Duboc Journal of Algorithms 10 (3), 403-412, 1989 | 61 | 1989 |
| On the tiling by translation problem S Brlek, X Provençal, JM Fédou Discrete Applied Mathematics 157 (3), 464-475, 2009 | 53 | 2009 |
| A relative of the Thue-Morse sequence JP Allouche, A Arnold, J Berstel, S Brlek, W Jockusch, S Plouffe, ... Discrete mathematics 139 (1-3), 455-461, 1995 | 46 | 1995 |
| Efficient computation of addition chains F Bergeron, J Berstel, S Brlek Journal de théorie des nombres de Bordeaux 6 (1), 21-38, 1994 | 45 | 1994 |
| The discrete Green Theorem and some applications in discrete geometry S Brlek, G Labelle, A Lacasse Theoretical Computer Science 346 (2-3), 200-225, 2005 | 43 | 2005 |
| A note on differentiable palindromes S Brlek, A Ladouceur Theoretical computer science 302 (1-3), 167-178, 2003 | 39 | 2003 |
| A flaw in the electronic commerce protocol SET S Brlek, S Hamadou, J Mullins Information Processing Letters 97 (3), 104-108, 2006 | 37 | 2006 |
| Combinatorial properties of f-palindromes in the Thue-Morse sequence A Blondin-Massé, S Brlek, A Garon, S Labbé Pure Math. Appl 19 (2-3), 39-52, 2008 | 34 | 2008 |
| On the length of word chains J Berstel, S Brlek Information processing letters 26 (1), 23-28, 1987 | 33 | 1987 |
| Properties of the contour path of discrete sets S Brlek, G Labelle, A Lacasse International Journal of Foundations of Computer Science 17 (03), 543-556, 2006 | 28 | 2006 |
| Smooth words over arbitrary alphabets V Berthé, S Brlek, P Choquette Theoretical computer science 341 (1-3), 293-310, 2005 | 28 | 2005 |
| Combinatorial properties of smooth infinite words S Brlek, S Dulucq, A Ladouceur, L Vuillon Theoretical computer science 352 (1-3), 306-317, 2006 | 26 | 2006 |
| Palindromic lacunas of the Thue-Morse word A Blondin Massé, S Brlek, S Labbé Proceedings Gascom 2008, 16-19 June 2008 Bibbiena (Arezzo-ITALY), 53-67, 2008 | 25 | 2008 |
| Tilings by translation: enumeration by a rational language approach S Brlek, A Frosini, S Rinaldi, L Vuillon The electronic journal of combinatorics, R15-R15, 2006 | 25 | 2006 |
| A note on a result of Daurat and Nivat S Brlek, G Labelle, A Lacasse Developments in Language Theory: 9th International Conference, DLT 2005 …, 2005 | 25 | 2005 |
| Palindromic complexity of codings of rotations AB Massé, S Brlek, S Labbé, L Vuillon Theoretical computer science 412 (46), 6455-6463, 2011 | 24 | 2011 |
| Synchronization of Constrained Transition Systems. S Brlek, A Rauzy PASCO, 54-62, 1994 | 24 | 1994 |
Alexandre Blondin MasséProfessor of Computer Science, Université du Québec à MontréalVerified email at uqam.ca
