Srecko Brlek

70 papers C 5Misc 1Journal 46Unranked 15
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the number of squares in a finite word.
Comb. Theory
Srecko Brlek, Shuo Li
2024 — ed.
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, GASCom 2024, Bordeaux, France, 24-28th June 2024.
GASCom
Srecko Brlek, Luca Ferrari
2023 — conf
On the Number of Distinct Squares in Finite Sequences: Some Old and New Results.
WORDS
Srecko Brlek, Shuo Li
2019 C conf
Burrows-Wheeler Transform of Words Defined by Morphisms.
IWOCA
Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi
2018 J jnl
Preface.
Int. J. Found. Comput. Sci.
Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer
2017 — ed.
Combinatorics on Words - 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings
WORDS
Srecko Brlek, Francesco Dolce, Christophe Reutenauer, Élise Vandomme
2016 — conf
A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences.
DGCI
Srecko Brlek, Andrea Frosini
2016 C ed.
Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings
DLT
Srecko Brlek, Christophe Reutenauer
2016 J jnl
Efficient operations on discrete paths.
Theor. Comput. Sci.
Alexandre Blondin Massé, Srecko Brlek, Hugo Tremblay
2016 J jnl
Reconstructing binary matrices with timetabling constraints.
J. Discrete Algorithms
Srecko Brlek, Stefano Brocchi, Andrea Frosini
2015 C conf
Palindromic Complexity of Trees.
DLT
Srecko Brlek, Nadia Lafrenière, Xavier Provençal
2014 — conf
Efficient Computation of the Outer Hull of a Discrete Path.
DGCI
Srecko Brlek, Hugo Tremblay, Jérôme Tremblay, Romaine Weber
2014 J jnl
Exhaustive generation of atomic combinatorial differential operators.
Theor. Comput. Sci.
Hugo Tremblay, Gilbert Labelle, Srecko Brlek, Alexandre Blondin Massé
2014 J jnl
Reconstructing Words from a σ-palindromic Language.
Fundam. Informaticae
Srecko Brlek, Nadia Lafrenière
2013 J jnl
Generation of Combinatorial Structures.
Theor. Comput. Sci.
Srecko Brlek, Christophe Reutenauer, Jean-Guy Penaud
2012 J jnl
A parallelogram tile fills the plane by translation in at most two distinct ways.
Discret. Appl. Math.
Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
2012 J jnl
Combinatorial variations on Cantorʼs diagonal.
J. Comb. Theory A
Srecko Brlek, Jean-Philippe Labbé, Michel Mendès France
2011 J jnl
A linear time and space algorithm for detecting path intersection in Z
Theor. Comput. Sci.
Srecko Brlek, Michel Koskas, Xavier Provençal
2011 J jnl
Advances in discrete geometry.
Theor. Comput. Sci.
Srecko Brlek, Xavier Provençal
2011 J jnl
Complexity and palindromic defect of infinite words.
Theor. Comput. Sci.
Srecko Brlek, Christophe Reutenauer
2011 J jnl
Discrete geometry for computer imagery.
Pattern Recognit. Lett.
Srecko Brlek, Xavier Provençal
2011 J jnl
Equations on palindromes and circular words.
Theor. Comput. Sci.
Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
2011 — conf
Interactions between Digital Geometry and Combinatorics on Words
WORDS
Srecko Brlek
2011 J jnl
Palindromic complexity of codings of rotations.
Theor. Comput. Sci.
Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon
2011 J jnl
Two infinite families of polyominoes that tile the plane by translation in two distinct ways.
Theor. Comput. Sci.
Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
2009 — conf
A Linear Time and Space Algorithm for Detecting Path Intersection.
DGCI
Srecko Brlek, Michel Koskas, Xavier Provençal
2009 — conf
Christoffel and Fibonacci Tiles.
DGCI
Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
2009 J jnl
Codings of rotations on two intervals are full.
Electron. Notes Discret. Math.
Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon
2009 — ed.
Discrete Geometry for Computer Imagery, 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings
DGCI
Srecko Brlek, Christophe Reutenauer, Xavier Provençal
2009 J jnl
Lyndon + Christoffel = digitally convex.
Pattern Recognit.
Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer
2009 J jnl
On the tiling by translation problem.
Discret. Appl. Math.
Srecko Brlek, Xavier Provençal, Jean-Marc Fedou
2009 C conf
PCIF: An Algorithm for Lossless True Color Image Compression.
IWCIA
Elena Barcucci, Srecko Brlek, Stefano Brocchi
2008 — conf
Combinatorial View of Digital Convexity.
DGCI
Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal
2008 J jnl
Discrete sets with minimal moment of inertia.
Theor. Comput. Sci.
Srecko Brlek, Gilbert Labelle, Annie Lacasse
2008 — conf
On Minimal Moment of Inertia Polyominoes.
DGCI
Srecko Brlek, Gilbert Labelle, Annie Lacasse
2008 — conf
Reconstructing words from a fixed palindromic length sequence.
IFIP TCS
Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi
2008 J jnl
Shuffle operations on discrete paths.
Theor. Comput. Sci.
Srecko Brlek, Gilbert Labelle, Annie Lacasse
2008 J jnl
Smooth words on 2-letter alphabets having same parity.
Theor. Comput. Sci.
Srecko Brlek, Damien Jamet, Geneviève Paquin
2007 — conf
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols.
SecCO@CONCUR
Srecko Brlek, Sardaouna Hamadou, John Mullins
2007 J jnl
On the Critical Exponent of Generalized Thue-Morse Words.
Discret. Math. Theor. Comput. Sci.
Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé
2007 J jnl
On the critical exponent of generalized Thue-Morse words.
CoRR
Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé
2007 J jnl
Preface.
Theor. Comput. Sci.
Srecko Brlek, Christophe Reutenauer
2007 J jnl
Properties of the Extremal Infinite Smooth Words.
Discret. Math. Theor. Comput. Sci.
Srecko Brlek, Guy Melançon, Geneviève Paquin
2006 J jnl
A flaw in the electronic commerce protocol SET.
Inf. Process. Lett.
Srecko Brlek, Sardaouna Hamadou, John Mullins
2006 — conf
An Optimal Algorithm for Detecting Pseudo-squares.
DGCI
Srecko Brlek, Xavier Provençal
2006 J jnl
Combinatorial properties of smooth infinite words.
Theor. Comput. Sci.
Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon
2006 J jnl
Non uniform random generation of generalized Motzkin paths.
Acta Informatica
Srecko Brlek, Elisa Pergola, Olivier Roques
2006 Misc conf
On the problem of deciding if a polyomino tiles the plane by translation.
PSC
Srecko Brlek, Xavier Provençal
2006 J jnl
Properties of the Contour Path of Discrete Sets.
Int. J. Found. Comput. Sci.
Srecko Brlek, Gilbert Labelle, Annie Lacasse
2006 — conf
Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET.
AICT/ICIW
Srecko Brlek, Sardaouna Hamadou, John Mullins
2006 J jnl
Tilings by Translation: Enumeration by a Rational Language Approach.
Electron. J. Comb.
Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon
2005 C conf
A Note on a Result of Daurat and Nivat.
Developments in Language Theory
Srecko Brlek, Gilbert Labelle, Annie Lacasse
2005 J jnl
Algorithms for polyominoes based on the discrete Green theorem.
Discret. Appl. Math.
Srecko Brlek, Gilbert Labelle, Annie Lacasse
2005 J jnl
Anonymous and Secure Electronic Transaction protocol.
Ann. des Télécommunications
Srecko Brlek, Sardaouna Hamadou, John Mullins
2005 J jnl
On the equivalence problem for succession rules.
Discret. Math.
Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi
2005 J jnl
Smooth words over arbitrary alphabets.
Theor. Comput. Sci.
Valérie Berthé, Srecko Brlek, Philippe Choquette
2005 J jnl
The discrete Green Theorem and some applications in discrete geometry.
Theor. Comput. Sci.
Srecko Brlek, Gilbert Labelle, Annie Lacasse
2004 J jnl
On The Palindromic Complexity Of Infinite Words.
Int. J. Found. Comput. Sci.
Srecko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer
2003 J jnl
A note on differentiable palindromes.
Theor. Comput. Sci.
Srecko Brlek, A. Ladouceur
2003 — conf
Incremental Algorithms Based on Discrete Green Theorem.
DGCI
Srecko Brlek, Gilbert Labelle, Annie Lacasse
2003 J jnl
On a valuation of rational subsets of Z
Theor. Comput. Sci.
Srecko Brlek, Christophe Reutenauer
1995 J jnl
A relative of the Thue-Morse sequence.
Discret. Math.
Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan
1995 J jnl
Automatic Verification of Properties in Transition Systems.
Softw. Pract. Exp.
André Arnold, Srecko Brlek
1995 J jnl
On-Line Evaluation of Powers Using Euclid's Algorithm.
RAIRO Theor. Informatics Appl.
Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette
1994 — conf
Synchronization of Constrained Transition Systems.
PASCO
Srecko Brlek, Antoine Rauzy
1991 — conf
On Addition Schemes.
TAPSOFT, Vol.2
Srecko Brlek, Pierre Castéran, Robert Strandh
1989 J jnl
Addition Chains Using Continued Fractions.
J. Algorithms
François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc
1989 J jnl
Enumeration of factors in the Thue-Morse word.
Discret. Appl. Math.
Srecko Brlek
1989 J jnl
Optimal Word Chains for the Thue-Morse Word
Inf. Comput.
André Arnold, Srecko Brlek
1987 J jnl
On the Length of Word Chains.
Inf. Process. Lett.
Jean Berstel, Srecko Brlek