Srecko Brlek

According to our database, Srecko Brlek authored at least 64 papers between 1987 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the Number of Distinct Squares in Finite Sequences: Some Old and New Results.

Srecko Brlek, Shuo Li

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2019

Burrows-Wheeler Transform of Words Defined by Morphisms.

Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Preface.

Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer

Int. J. Found. Comput. Sci., 2018

2016

Efficient operations on discrete paths.

Alexandre Blondin Massé, Srecko Brlek, Hugo Tremblay

Theor. Comput. Sci., 2016

Reconstructing binary matrices with timetabling constraints.

Srecko Brlek, Stefano Brocchi, Andrea Frosini

J. Discrete Algorithms, 2016

A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences.

Srecko Brlek, Andrea Frosini

Proceedings of the Discrete Geometry for Computer Imagery, 2016

2015

Palindromic Complexity of Trees.

Srecko Brlek, Nadia Lafrenière, Xavier Provençal

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014

Exhaustive generation of atomic combinatorial differential operators.

Hugo Tremblay, Gilbert Labelle, Srecko Brlek, Alexandre Blondin Massé

Theor. Comput. Sci., 2014

Reconstructing Words from a σ-palindromic Language.

Srecko Brlek, Nadia Lafrenière

Fundam. Informaticae, 2014

Efficient Computation of the Outer Hull of a Discrete Path.

Srecko Brlek, Hugo Tremblay, Jérôme Tremblay, Romaine Weber

Proceedings of the Discrete Geometry for Computer Imagery, 2014

2013

Generation of Combinatorial Structures.

Srecko Brlek, Christophe Reutenauer, Jean-Guy Penaud

Theor. Comput. Sci., 2013

2012

Combinatorial variations on Cantorʼs diagonal.

Srecko Brlek, Jean-Philippe Labbé, Michel Mendès France

J. Comb. Theory A, 2012

A parallelogram tile fills the plane by translation in at most two distinct ways.

Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé

Discret. Appl. Math., 2012

2011

Palindromic complexity of codings of rotations.

Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon

Theor. Comput. Sci., 2011

Two infinite families of polyominoes that tile the plane by translation in two distinct ways.

Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé

Theor. Comput. Sci., 2011

Equations on palindromes and circular words.

Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé

Theor. Comput. Sci., 2011

Complexity and palindromic defect of infinite words.

Srecko Brlek, Christophe Reutenauer

Theor. Comput. Sci., 2011

Advances in discrete geometry.

Srecko Brlek, Xavier Provençal

Theor. Comput. Sci., 2011

A linear time and space algorithm for detecting path intersection in Z^d.

Srecko Brlek, Michel Koskas, Xavier Provençal

Theor. Comput. Sci., 2011

Discrete geometry for computer imagery.

Srecko Brlek, Xavier Provençal

Pattern Recognit. Lett., 2011

Interactions between Digital Geometry and Combinatorics on Words

Srecko Brlek

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

2009

Lyndon + Christoffel = digitally convex.

Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer

Pattern Recognit., 2009

Codings of rotations on two intervals are full.

Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon

Electron. Notes Discret. Math., 2009

On the tiling by translation problem.

Srecko Brlek, Xavier Provençal, Jean-Marc Fedou

Discret. Appl. Math., 2009

PCIF: An Algorithm for Lossless True Color Image Compression.

Elena Barcucci, Srecko Brlek, Stefano Brocchi

Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Christoffel and Fibonacci Tiles.

Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé

Proceedings of the Discrete Geometry for Computer Imagery, 2009

A Linear Time and Space Algorithm for Detecting Path Intersection.

Srecko Brlek, Michel Koskas, Xavier Provençal

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Discrete sets with minimal moment of inertia.

Srecko Brlek, Gilbert Labelle, Annie Lacasse

Theor. Comput. Sci., 2008

Shuffle operations on discrete paths.

Srecko Brlek, Gilbert Labelle, Annie Lacasse

Theor. Comput. Sci., 2008

Smooth words on 2-letter alphabets having same parity.

Srecko Brlek, Damien Jamet, Geneviève Paquin

Theor. Comput. Sci., 2008

Reconstructing words from a fixed palindromic length sequence.

Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Combinatorial View of Digital Convexity.

Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal

Proceedings of the Discrete Geometry for Computer Imagery, 2008

On Minimal Moment of Inertia Polyominoes.

Srecko Brlek, Gilbert Labelle, Annie Lacasse

Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007

Preface.

Srecko Brlek, Christophe Reutenauer

Theor. Comput. Sci., 2007

A Probabilistic Scheduler for the Analysis of Cryptographic Protocols.

Srecko Brlek, Sardaouna Hamadou, John Mullins

Proceedings of the Fifth Workshop on Security Issues in Concurrency, 2007

On the Critical Exponent of Generalized Thue-Morse Words.

Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé

Discret. Math. Theor. Comput. Sci., 2007

Properties of the Extremal Infinite Smooth Words.

Srecko Brlek, Guy Melançon, Geneviève Paquin

Discret. Math. Theor. Comput. Sci., 2007

2006

Combinatorial properties of smooth infinite words.

Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon

Theor. Comput. Sci., 2006

A flaw in the electronic commerce protocol SET.

Srecko Brlek, Sardaouna Hamadou, John Mullins

Inf. Process. Lett., 2006

Properties of the Contour Path of Discrete Sets.

Srecko Brlek, Gilbert Labelle, Annie Lacasse

Int. J. Found. Comput. Sci., 2006

Tilings by Translation: Enumeration by a Rational Language Approach.

Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon

Electron. J. Comb., 2006

Non uniform random generation of generalized Motzkin paths.

Srecko Brlek, Elisa Pergola, Olivier Roques

Acta Informatica, 2006

On the problem of deciding if a polyomino tiles the plane by translation.

Srecko Brlek, Xavier Provençal

Proceedings of the Prague Stringology Conference, 2006

An Optimal Algorithm for Detecting Pseudo-squares.

Srecko Brlek, Xavier Provençal

Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET.

Srecko Brlek, Sardaouna Hamadou, John Mullins

Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006

2005

The discrete Green Theorem and some applications in discrete geometry.

Srecko Brlek, Gilbert Labelle, Annie Lacasse

Theor. Comput. Sci., 2005

Smooth words over arbitrary alphabets.

Valérie Berthé, Srecko Brlek, Philippe Choquette

Theor. Comput. Sci., 2005

On the equivalence problem for succession rules.

Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi

Discret. Math., 2005

Algorithms for polyominoes based on the discrete Green theorem.

Srecko Brlek, Gilbert Labelle, Annie Lacasse

Discret. Appl. Math., 2005

Anonymous and Secure Electronic Transaction protocol.

Srecko Brlek, Sardaouna Hamadou, John Mullins

Ann. des Télécommunications, 2005

A Note on a Result of Daurat and Nivat.

Srecko Brlek, Gilbert Labelle, Annie Lacasse

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

On The Palindromic Complexity Of Infinite Words.

Srecko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer

Int. J. Found. Comput. Sci., 2004

2003

On a valuation of rational subsets of Z^k Dédié à Jean Berstel

Srecko Brlek, Christophe Reutenauer

Theor. Comput. Sci., 2003

A note on differentiable palindromes.

Srecko Brlek, A. Ladouceur

Theor. Comput. Sci., 2003

Incremental Algorithms Based on Discrete Green Theorem.

Srecko Brlek, Gilbert Labelle, Annie Lacasse

Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

1995

Automatic Verification of Properties in Transition Systems.

André Arnold, Srecko Brlek

Softw. Pract. Exp., 1995

On-Line Evaluation of Powers Using Euclid's Algorithm.

Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette

RAIRO Theor. Informatics Appl., 1995

A relative of the Thue-Morse sequence.

Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan

Discret. Math., 1995

1994

Synchronization of Constrained Transition Systems.

Srecko Brlek, Antoine Rauzy

Proceedings of the First International Symposium on Parallel Symbolic Computation, 1994

1991

On Addition Schemes.

Srecko Brlek, Pierre Castéran, Robert Strandh

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

1989

Optimal Word Chains for the Thue-Morse Word

André Arnold, Srecko Brlek

Inf. Comput., November, 1989

Addition Chains Using Continued Fractions.

François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc

J. Algorithms, 1989

Enumeration of factors in the Thue-Morse word.

Srecko Brlek

Discret. Appl. Math., 1989

1987

On the Length of Word Chains.

Jean Berstel, Srecko Brlek

Inf. Process. Lett., 1987