Srecko Brlek

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 8

Top Topics

Differential Operators

Binary Matrices

Annual Computer Personnel Research Conference

Indian Languages

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Publications

Srecko Brlek, Luca Ferrari
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings. CoRR (2024)
Srecko Brlek, Shuo Li
On the Number of Distinct Squares in Finite Sequences: Some Old and New Results. WORDS (2023)
Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi
Burrows-Wheeler Transform of Words Defined by Morphisms. IWOCA (2019)
Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer
Preface. Int. J. Found. Comput. Sci. 29 (5) (2018)
Alexandre Blondin Massé, Srecko Brlek, Hugo Tremblay
Efficient operations on discrete paths. Theor. Comput. Sci. 624 (2016)
Srecko Brlek, Stefano Brocchi, Andrea Frosini
Reconstructing binary matrices with timetabling constraints. J. Discrete Algorithms (2016)
Srecko Brlek, Andrea Frosini
A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences. DGCI (2016)
Srecko Brlek, Nadia Lafrenière, Xavier Provençal
Palindromic Complexity of Trees. DLT (2015)
Srecko Brlek, Hugo Tremblay, Jérôme Tremblay, Romaine Weber
Efficient Computation of the Outer Hull of a Discrete Path. DGCI (2014)
Hugo Tremblay, Gilbert Labelle, Srecko Brlek, Alexandre Blondin Massé
Exhaustive generation of atomic combinatorial differential operators. Theor. Comput. Sci. 536 (2014)
Srecko Brlek, Nadia Lafrenière
Reconstructing Words from a σ-palindromic Language. Fundam. Informaticae 135 (1-2) (2014)
Srecko Brlek, Christophe Reutenauer, Jean-Guy Penaud
Generation of Combinatorial Structures. Theor. Comput. Sci. 502 (2013)
Srecko Brlek, Jean-Philippe Labbé, Michel Mendès France
Combinatorial variations on Cantorʼs diagonal. J. Comb. Theory, Ser. A 119 (3) (2012)
Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
A parallelogram tile fills the plane by translation in at most two distinct ways. Discret. Appl. Math. 160 (7-8) (2012)
Srecko Brlek, Xavier Provençal
Advances in discrete geometry. Theor. Comput. Sci. 412 (36) (2011)
Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon
Palindromic complexity of codings of rotations. Theor. Comput. Sci. 412 (46) (2011)
Srecko Brlek, Christophe Reutenauer
Complexity and palindromic defect of infinite words. Theor. Comput. Sci. 412 (4-5) (2011)
Srecko Brlek, Xavier Provençal
Discrete geometry for computer imagery. Pattern Recognit. Lett. 32 (9) (2011)
Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
Equations on palindromes and circular words. Theor. Comput. Sci. 412 (27) (2011)
Srecko Brlek, Michel Koskas, Xavier Provençal
. Theor. Comput. Sci. 412 (36) (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) (2011)
Srecko Brlek
Interactions between Digital Geometry and Combinatorics on Words WORDS (2011)
Srecko Brlek, Xavier Provençal, Jean-Marc Fedou
On the tiling by translation problem. Discret. Appl. Math. 157 (3) (2009)
Srecko Brlek, Michel Koskas, Xavier Provençal
A Linear Time and Space Algorithm for Detecting Path Intersection. DGCI (2009)
Elena Barcucci, Srecko Brlek, Stefano Brocchi
PCIF: An Algorithm for Lossless True Color Image Compression. IWCIA (2009)
Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon
Codings of rotations on two intervals are full. Electron. Notes Discret. Math. 34 (2009)
Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer
Lyndon + Christoffel = digitally convex. Pattern Recognit. 42 (10) (2009)
Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
Christoffel and Fibonacci Tiles. DGCI (2009)
Srecko Brlek, Gilbert Labelle, Annie Lacasse
On Minimal Moment of Inertia Polyominoes. DGCI (2008)
Srecko Brlek, Gilbert Labelle, Annie Lacasse
Shuffle operations on discrete paths. Theor. Comput. Sci. 391 (1-2) (2008)
Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi
Reconstructing words from a fixed palindromic length sequence. IFIP TCS (2008)
Srecko Brlek, Gilbert Labelle, Annie Lacasse
Discrete sets with minimal moment of inertia. Theor. Comput. Sci. 406 (1-2) (2008)
Srecko Brlek, Damien Jamet, Geneviève Paquin
Smooth words on 2-letter alphabets having same parity. Theor. Comput. Sci. 393 (1-3) (2008)
Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal
Combinatorial View of Digital Convexity. DGCI (2008)
Srecko Brlek, Christophe Reutenauer
Preface. Theor. Comput. Sci. 380 (3) (2007)
Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé
On the critical exponent of generalized Thue-Morse words. CoRR (2007)
Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé
On the Critical Exponent of Generalized Thue-Morse Words. Discret. Math. Theor. Comput. Sci. 9 (1) (2007)
Srecko Brlek, Sardaouna Hamadou, John Mullins
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols. Electron. Notes Theor. Comput. Sci. 194 (1) (2007)
Srecko Brlek, Guy Melançon, Geneviève Paquin
Properties of the Extremal Infinite Smooth Words. Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Srecko Brlek, Elisa Pergola, Olivier Roques
Non uniform random generation of generalized Motzkin paths. Acta Informatica 42 (8-9) (2006)
Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon
Combinatorial properties of smooth infinite words. Theor. Comput. Sci. 352 (1-3) (2006)
Srecko Brlek, Xavier Provençal
An Optimal Algorithm for Detecting Pseudo-squares. DGCI (2006)
Srecko Brlek, Sardaouna Hamadou, John Mullins
Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET. AICT/ICIW (2006)
Srecko Brlek, Sardaouna Hamadou, John Mullins
A flaw in the electronic commerce protocol SET. Inf. Process. Lett. 97 (3) (2006)
Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon
Tilings by Translation: Enumeration by a Rational Language Approach. Electron. 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) (2006)
Srecko Brlek, Xavier Provençal
On the problem of deciding if a polyomino tiles the plane by translation. Stringology (2006)
Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi
On the equivalence problem for succession rules. Discret. Math. 298 (1-3) (2005)
Srecko Brlek, Sardaouna Hamadou, John Mullins
Anonymous and Secure Electronic Transaction protocol. Ann. des Télécommunications 60 (5-6) (2005)
Valérie Berthé, Srecko Brlek, Philippe Choquette
Smooth words over arbitrary alphabets. Theor. Comput. Sci. 341 (1-3) (2005)
Srecko Brlek, Gilbert Labelle, Annie Lacasse
Algorithms for polyominoes based on the discrete Green theorem. Discret. Appl. Math. 147 (2-3) (2005)
Srecko Brlek, Gilbert Labelle, Annie Lacasse
The discrete Green Theorem and some applications in discrete geometry. Theor. Comput. Sci. 346 (2-3) (2005)
Srecko Brlek, Gilbert Labelle, Annie Lacasse
A Note on a Result of Daurat and Nivat. Developments in Language Theory (2005)
Srecko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer
On The Palindromic Complexity Of Infinite Words. Int. J. Found. Comput. Sci. 15 (2) (2004)
Srecko Brlek, Christophe Reutenauer
Dédié à Jean Berstel Theor. Comput. Sci. 292 (1) (2003)
Srecko Brlek, Gilbert Labelle, Annie Lacasse
Incremental Algorithms Based on Discrete Green Theorem. DGCI (2003)
Srecko Brlek, A. Ladouceur
A note on differentiable palindromes. Theor. Comput. Sci. 302 (1-3) (2003)
André Arnold, Srecko Brlek
Automatic Verification of Properties in Transition Systems. Softw. Pract. Exp. 25 (6) (1995)
Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan
A relative of the Thue-Morse sequence. Discret. Math. 139 (1-3) (1995)
Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette
On-Line Evaluation of Powers Using Euclid's Algorithm. RAIRO Theor. Informatics Appl. 29 (5) (1995)
Srecko Brlek, Antoine Rauzy
Synchronization of Constrained Transition Systems. PASCO (1994)
Srecko Brlek, Pierre Castéran, Robert Strandh
On Addition Schemes. TAPSOFT, Vol.2 (1991)
Srecko Brlek
Enumeration of factors in the Thue-Morse word. Discret. Appl. Math. 24 (1-3) (1989)
André Arnold, Srecko Brlek
Optimal Word Chains for the Thue-Morse Word Inf. Comput. 83 (2) (1989)
François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc
Addition Chains Using Continued Fractions. J. Algorithms 10 (3) (1989)
Jean Berstel, Srecko Brlek
On the Length of Word Chains. Inf. Process. Lett. 26 (1) (1987)