| 2009 | ||
|---|---|---|
| 41 | Srecko Brlek, Christophe Reutenauer, Xavier Provençal: Discrete Geometry for Computer Imagery, 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings Springer 2009 | |
| 40 | Srecko Brlek, Michel Koskas, Xavier Provençal: A Linear Time and Space Algorithm for Detecting Path Intersection. DGCI 2009: 397-408 | |
| 39 | Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé: Christoffel and Fibonacci Tiles. DGCI 2009: 67-78 | |
| 38 | Srecko Brlek, Xavier Provençal, Jean-Marc Fedou: On the tiling by translation problem. Discrete Applied Mathematics 157(3): 464-475 (2009) | |
| 37 | Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer: Lyndon + Christoffel = digitally convex. Pattern Recognition 42(10): 2239-2246 (2009) | |
| 2008 | ||
| 36 | Srecko Brlek, Gilbert Labelle, Annie Lacasse: On Minimal Moment of Inertia Polyominoes. DGCI 2008: 299-309 | |
| 35 | Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal: Combinatorial View of Digital Convexity. DGCI 2008: 57-68 | |
| 34 | Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi: Reconstructing words from a fixed palindromic length sequence. IFIP TCS 2008: 101-114 | |
| 33 | Srecko Brlek, Gilbert Labelle, Annie Lacasse: Shuffle operations on discrete paths. Theor. Comput. Sci. 391(1-2): 75-89 (2008) | |
| 32 | Srecko Brlek, Damien Jamet, Geneviève Paquin: Smooth words on 2-letter alphabets having same parity. Theor. Comput. Sci. 393(1-3): 166-181 (2008) | |
| 31 | Srecko Brlek, Gilbert Labelle, Annie Lacasse: Discrete sets with minimal moment of inertia. Theor. Comput. Sci. 406(1-2): 31-42 (2008) | |
| 2007 | ||
| 30 | Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé: On the Critical Exponent of Generalized Thue-Morse Words. Discrete Mathematics & Theoretical Computer Science 9(1): (2007) | |
| 29 | Srecko Brlek, Guy Melançon, Geneviève Paquin: Properties of the Extremal Infinite Smooth Words. Discrete Mathematics & Theoretical Computer Science 9(2): (2007) | |
| 28 | Srecko Brlek, Sardaouna Hamadou, John Mullins: A Probabilistic Scheduler for the Analysis of Cryptographic Protocols. Electr. Notes Theor. Comput. Sci. 194(1): 61-83 (2007) | |
| 27 | Srecko Brlek, Christophe Reutenauer: Preface. Theor. Comput. Sci. 380(3): 219 (2007) | |
| 2006 | ||
| 26 | Srecko Brlek, Sardaouna Hamadou, John Mullins: Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET. AICT/ICIW 2006: 119 | |
| 25 | Srecko Brlek, Xavier Provençal: An Optimal Algorithm for Detecting Pseudo-squares. DGCI 2006: 403-412 | |
| 24 | Srecko Brlek, Xavier Provençal: On the problem of deciding if a polyomino tiles the plane by translation. Stringology 2006: 65-76 | |
| 23 | Srecko Brlek, Elisa Pergola, Olivier Roques: Non uniform random generation of generalized Motzkin paths. Acta Inf. 42(8-9): 603-616 (2006) | |
| 22 | Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon: Tilings by Translation: Enumeration by a Rational Language Approach. Electr. J. Comb. 13(1): (2006) | |
| 21 | Srecko Brlek, Sardaouna Hamadou, John Mullins: A flaw in the electronic commerce protocol SET. Inf. Process. Lett. 97(3): 104-108 (2006) | |
| 20 | Srecko Brlek, Gilbert Labelle, Annie Lacasse: Properties of the Contour Path of Discrete Sets. Int. J. Found. Comput. Sci. 17(3): 543-556 (2006) | |
| 19 | Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon: Combinatorial properties of smooth infinite words. Theor. Comput. Sci. 352(1-3): 306-317 (2006) | |
| 2005 | ||
| 18 | Srecko Brlek, Gilbert Labelle, Annie Lacasse: A Note on a Result of Daurat and Nivat. Developments in Language Theory 2005: 189-198 | |
| 17 | Srecko Brlek, Sardaouna Hamadou, John Mullins: Anonymous and Secure Electronic Transaction protocol. Annales des Télécommunications 60(5-6): 530-557 (2005) | |
| 16 | Srecko Brlek, Gilbert Labelle, Annie Lacasse: Algorithms for polyominoes based on the discrete Green theorem. Discrete Applied Mathematics 147(2-3): 187-205 (2005) | |
| 15 | Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi: On the equivalence problem for succession rules. Discrete Mathematics 298(1-3): 142-154 (2005) | |
| 14 | Valérie Berthé, Srecko Brlek, Philippe Choquette: Smooth words over arbitrary alphabets. Theor. Comput. Sci. 341(1-3): 293-310 (2005) | |
| 13 | Srecko Brlek, Gilbert Labelle, Annie Lacasse: The discrete Green Theorem and some applications in discrete geometry. Theor. Comput. Sci. 346(2-3): 200-225 (2005) | |
| 2004 | ||
| 12 | Srecko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer: On The Palindromic Complexity Of Infinite Words. Int. J. Found. Comput. Sci. 15(2): 293-306 (2004) | |
| 2003 | ||
| 11 | Srecko Brlek, Gilbert Labelle, Annie Lacasse: Incremental Algorithms Based on Discrete Green Theorem. DGCI 2003: 277-287 | |
| 10 | Srecko Brlek, Christophe Reutenauer: On a valuation of rational subsets of Zk Dédié à Jean Berstel Theor. Comput. Sci. 292(1): 85-96 (2003) | |
| 9 | Srecko Brlek, A. Ladouceur: A note on differentiable palindromes. Theor. Comput. Sci. 302(1-3): 167-178 (2003) | |
| 1995 | ||
| 8 | Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan: A relative of the Thue-Morse sequence. Discrete Mathematics 139(1-3): 455-461 (1995) | |
| 7 | Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette: On-Line Evaluation of Powers Using Euclid's Algorithm. ITA 29(5): 431-450 (1995) | |
| 6 | André Arnold, Srecko Brlek: Automatic Verification of Properties in Transition Systems. Softw., Pract. Exper. 25(6): 579-596 (1995) | |
| 1991 | ||
| 5 | Srecko Brlek, Pierre Castéran, Robert Strandh: On Addition Schemes. TAPSOFT, Vol.2 1991: 379-393 | |
| 1989 | ||
| 4 | Srecko Brlek: Enumeration of factors in the Thue-Morse word. Discrete Applied Mathematics 24(1-3): 83-96 (1989) | |
| 3 | André Arnold, Srecko Brlek: Optimal Word Chains for the Thue-Morse Word Inf. Comput. 83(2): 140-151 (1989) | |
| 2 | François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc: Addition Chains Using Continued Fractions. J. Algorithms 10(3): 403-412 (1989) | |
| 1987 | ||
| 1 | Jean Berstel, Srecko Brlek: On the Length of Word Chains. Inf. Process. Lett. 26(1): 23-28 (1987) | |