Srecko Brlek

Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé: A parallelogram tile fills the plane by translation in at most two distinct ways. Discrete Applied Mathematics 160(7-8): 1011-1018 (2012)

Srecko Brlek, Jean-Philippe Labbé, Michel Mendès France: Combinatorial variations on Cantorʼs diagonal. J. Comb. Theory, Ser. A 119(3): 655-667 (2012)

Srecko Brlek, Xavier Provençal: Discrete geometry for computer imagery. Pattern Recognition Letters 32(9): 1355 (2011)

Srecko Brlek, Christophe Reutenauer: Complexity and palindromic defect of infinite words. Theor. Comput. Sci. 412(4-5): 493-497 (2011)

Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé: Equations on palindromes and circular words. Theor. Comput. Sci. 412(27): 2922-2930 (2011)

Srecko Brlek, Xavier Provençal: Advances in discrete geometry. Theor. Comput. Sci. 412(36): 4755-4756 (2011)

Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé: Two infinite families of polyominoes that tile the plane by translation in two distinct ways. Theor. Comput. Sci. 412(36): 4778-4786 (2011)

Srecko Brlek, Michel Koskas, Xavier Provençal: A linear time and space algorithm for detecting path intersection in Z^d. Theor. Comput. Sci. 412(36): 4841-4850 (2011)

Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon: Palindromic complexity of codings of rotations. Theor. Comput. Sci. 412(46): 6455-6463 (2011)

Srecko Brlek: Interactions between Digital Geometry and Combinatorics on Words. WORDS 2011: 1-12

Srecko Brlek, Xavier Provençal, Jean-Marc Fedou: On the tiling by translation problem. Discrete Applied Mathematics 157(3): 464-475 (2009)

Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon: Codings of rotations on two intervals are full. Electronic Notes in Discrete Mathematics 34: 289-293 (2009)

Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer: Lyndon + Christoffel = digitally convex. Pattern Recognition 42(10): 2239-2246 (2009)

Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé: Christoffel and Fibonacci Tiles. DGCI 2009: 67-78

Srecko Brlek, Michel Koskas, Xavier Provençal: A Linear Time and Space Algorithm for Detecting Path Intersection. DGCI 2009: 397-408

Elena Barcucci, Srecko Brlek, Stefano Brocchi: PCIF: An Algorithm for Lossless True Color Image Compression. IWCIA 2009: 224-237

Srecko Brlek, Christophe Reutenauer, Xavier Provençal (Eds.): Discrete Geometry for Computer Imagery, 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings. Lecture Notes in Computer Science 5810, Springer 2009, isbn 978-3-642-04396-3

Srecko Brlek, Gilbert Labelle, Annie Lacasse: Shuffle operations on discrete paths. Theor. Comput. Sci. 391(1-2): 75-89 (2008)

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)

Srecko Brlek, Gilbert Labelle, Annie Lacasse: Discrete sets with minimal moment of inertia. Theor. Comput. Sci. 406(1-2): 31-42 (2008)

Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal: Combinatorial View of Digital Convexity. DGCI 2008: 57-68

Srecko Brlek, Gilbert Labelle, Annie Lacasse: On Minimal Moment of Inertia Polyominoes. DGCI 2008: 299-309

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

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)

Srecko Brlek, Guy Melançon, Geneviève Paquin: Properties of the Extremal Infinite Smooth Words. Discrete Mathematics & Theoretical Computer Science 9(2) (2007)

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)

Srecko Brlek, Christophe Reutenauer: Preface. Theor. Comput. Sci. 380(3): 219 (2007)

Srecko Brlek, Elisa Pergola, Olivier Roques: Non uniform random generation of generalized Motzkin paths. Acta Inf. 42(8-9): 603-616 (2006)

Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon: Tilings by Translation: Enumeration by a Rational Language Approach. Electr. J. Comb. 13(1) (2006)

Srecko Brlek, Gilbert Labelle, Annie Lacasse: Properties of the Contour Path of Discrete Sets. Int. J. Found. Comput. Sci. 17(3): 543-556 (2006)

Srecko Brlek, Sardaouna Hamadou, John Mullins: A flaw in the electronic commerce protocol SET. Inf. Process. Lett. 97(3): 104-108 (2006)

Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon: Combinatorial properties of smooth infinite words. Theor. Comput. Sci. 352(1-3): 306-317 (2006)

Srecko Brlek, Sardaouna Hamadou, John Mullins: Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET. AICT/ICIW 2006: 119

Srecko Brlek, Xavier Provençal: An Optimal Algorithm for Detecting Pseudo-squares. DGCI 2006: 403-412

Srecko Brlek, Xavier Provençal: On the problem of deciding if a polyomino tiles the plane by translation. Stringology 2006: 65-76

Srecko Brlek, Sardaouna Hamadou, John Mullins: Anonymous and Secure Electronic Transaction protocol. Annales des Télécommunications 60(5-6): 530-557 (2005)

Srecko Brlek, Gilbert Labelle, Annie Lacasse: Algorithms for polyominoes based on the discrete Green theorem. Discrete Applied Mathematics 147(2-3): 187-205 (2005)

Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi: On the equivalence problem for succession rules. Discrete Mathematics 298(1-3): 142-154 (2005)

Valérie Berthé, Srecko Brlek, Philippe Choquette: Smooth words over arbitrary alphabets. Theor. Comput. Sci. 341(1-3): 293-310 (2005)

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)

Srecko Brlek, Gilbert Labelle, Annie Lacasse: A Note on a Result of Daurat and Nivat. Developments in Language Theory 2005: 189-198

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)

Srecko Brlek, Christophe Reutenauer: On a valuation of rational subsets of Z^k Dédié à Jean Berstel. Theor. Comput. Sci. 292(1): 85-96 (2003)

Srecko Brlek, A. Ladouceur: A note on differentiable palindromes. Theor. Comput. Sci. 302(1-3): 167-178 (2003)

Srecko Brlek, Gilbert Labelle, Annie Lacasse: Incremental Algorithms Based on Discrete Green Theorem. DGCI 2003: 277-287

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)

Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette: On-Line Evaluation of Powers Using Euclid's Algorithm. ITA 29(5): 431-450 (1995)

André Arnold, Srecko Brlek: Automatic Verification of Properties in Transition Systems. Softw., Pract. Exper. 25(6): 579-596 (1995)

Srecko Brlek, Pierre Castéran, Robert Strandh: On Addition Schemes. TAPSOFT, Vol.2 1991: 379-393

Srecko Brlek: Enumeration of factors in the Thue-Morse word. Discrete Applied Mathematics 24(1-3): 83-96 (1989)

André Arnold, Srecko Brlek: Optimal Word Chains for the Thue-Morse Word. Inf. Comput. 83(2): 140-151 (1989)

François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc: Addition Chains Using Continued Fractions. J. Algorithms 10(3): 403-412 (1989)

Jean Berstel, Srecko Brlek: On the Length of Word Chains. Inf. Process. Lett. 26(1): 23-28 (1987)