Srecko Brlek

According to our database1, Srecko Brlek
  • authored at least 61 papers between 1987 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Efficient operations on discrete paths.
Theor. Comput. Sci., 2016

Reconstructing binary matrices with timetabling constraints.
J. Discrete Algorithms, 2016

A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences.
Proceedings of the Discrete Geometry for Computer Imagery, 2016

2015
Palindromic Complexity of Trees.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Exhaustive generation of atomic combinatorial differential operators.
Theor. Comput. Sci., 2014

Reconstructing Words from a σ-palindromic Language.
Fundam. Inform., 2014

Efficient Computation of the Outer Hull of a Discrete Path.
Proceedings of the Discrete Geometry for Computer Imagery, 2014

2013
Generation of Combinatorial Structures.
Theor. Comput. Sci., 2013

2012
Combinatorial variations on Cantorʼs diagonal.
J. Comb. Theory, Ser. A, 2012

A parallelogram tile fills the plane by translation in at most two distinct ways.
Discrete Applied Mathematics, 2012

2011
Palindromic complexity of codings of rotations.
Theor. Comput. Sci., 2011

Two infinite families of polyominoes that tile the plane by translation in two distinct ways.
Theor. Comput. Sci., 2011

Equations on palindromes and circular words.
Theor. Comput. Sci., 2011

Complexity and palindromic defect of infinite words.
Theor. Comput. Sci., 2011

Advances in discrete geometry.
Theor. Comput. Sci., 2011

A linear time and space algorithm for detecting path intersection in Zd.
Theor. Comput. Sci., 2011

Discrete geometry for computer imagery.
Pattern Recognition Letters, 2011

Interactions between Digital Geometry and Combinatorics on Words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

2009
Lyndon + Christoffel = digitally convex.
Pattern Recognition, 2009

Codings of rotations on two intervals are full.
Electronic Notes in Discrete Mathematics, 2009

On the tiling by translation problem.
Discrete Applied Mathematics, 2009

PCIF: An Algorithm for Lossless True Color Image Compression.
Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Christoffel and Fibonacci Tiles.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

A Linear Time and Space Algorithm for Detecting Path Intersection.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008
Discrete sets with minimal moment of inertia.
Theor. Comput. Sci., 2008

Shuffle operations on discrete paths.
Theor. Comput. Sci., 2008

Smooth words on 2-letter alphabets having same parity.
Theor. Comput. Sci., 2008

Reconstructing words from a fixed palindromic length sequence.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Combinatorial View of Digital Convexity.
Proceedings of the Discrete Geometry for Computer Imagery, 2008

On Minimal Moment of Inertia Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007
Preface.
Theor. Comput. Sci., 2007

A Probabilistic Scheduler for the Analysis of Cryptographic Protocols.
Electr. Notes Theor. Comput. Sci., 2007

On the Critical Exponent of Generalized Thue-Morse Words.
Discrete Mathematics & Theoretical Computer Science, 2007

Properties of the Extremal Infinite Smooth Words.
Discrete Mathematics & Theoretical Computer Science, 2007

On the critical exponent of generalized Thue-Morse words.
CoRR, 2007

2006
Combinatorial properties of smooth infinite words.
Theor. Comput. Sci., 2006

A flaw in the electronic commerce protocol SET.
Inf. Process. Lett., 2006

Properties of the Contour Path of Discrete Sets.
Int. J. Found. Comput. Sci., 2006

Tilings by Translation: Enumeration by a Rational Language Approach.
Electr. J. Comb., 2006

Non uniform random generation of generalized Motzkin paths.
Acta Inf., 2006

On the problem of deciding if a polyomino tiles the plane by translation.
Proceedings of the Prague Stringology Conference, 2006

An Optimal Algorithm for Detecting Pseudo-squares.
Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET.
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.
Theor. Comput. Sci., 2005

Smooth words over arbitrary alphabets.
Theor. Comput. Sci., 2005

On the equivalence problem for succession rules.
Discrete Mathematics, 2005

Algorithms for polyominoes based on the discrete Green theorem.
Discrete Applied Mathematics, 2005

Anonymous and Secure Electronic Transaction protocol.
Annales des Télécommunications, 2005

A Note on a Result of Daurat and Nivat.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
On The Palindromic Complexity Of Infinite Words.
Int. J. Found. Comput. Sci., 2004

2003
On a valuation of rational subsets of Zk Dédié à Jean Berstel
Theor. Comput. Sci., 2003

A note on differentiable palindromes.
Theor. Comput. Sci., 2003

Incremental Algorithms Based on Discrete Green Theorem.
Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

1995
Automatic Verification of Properties in Transition Systems.
Softw., Pract. Exper., 1995

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

A relative of the Thue-Morse sequence.
Discrete Mathematics, 1995

1991
On Addition Schemes.
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
Inf. Comput., November, 1989

Addition Chains Using Continued Fractions.
J. Algorithms, 1989

Enumeration of factors in the Thue-Morse word.
Discrete Applied Mathematics, 1989

1987
On the Length of Word Chains.
Inf. Process. Lett., 1987


  Loading...