default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrecko Brlek
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[e4]Srecko Brlek, Luca Ferrari:
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. EPTCS 403, 2024 [contents]- 2023
- [c20]Srecko Brlek, Shuo Li:
On the Number of Distinct Squares in Finite Sequences: Some Old and New Results. WORDS 2023: 35-44
2010 – 2019
- 2019
- [c19]Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi:
Burrows-Wheeler Transform of Words Defined by Morphisms. IWOCA 2019: 393-404 - 2018
- [j44]Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer:
Preface. Int. J. Found. Comput. Sci. 29(5): 701-704 (2018) - 2017
- [e3]Srecko Brlek, Francesco Dolce, Christophe Reutenauer, Élise Vandomme
:
Combinatorics on Words - 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings. Lecture Notes in Computer Science 10432, Springer 2017, ISBN 978-3-319-66395-1 [contents] - 2016
- [j43]Srecko Brlek, Stefano Brocchi, Andrea Frosini:
Reconstructing binary matrices with timetabling constraints. J. Discrete Algorithms 38-41: 20-31 (2016) - [j42]Alexandre Blondin Massé, Srecko Brlek, Hugo Tremblay:
Efficient operations on discrete paths. Theor. Comput. Sci. 624: 121-135 (2016) - [c18]Srecko Brlek, Andrea Frosini:
A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences. DGCI 2016: 95-104 - [e2]Srecko Brlek, Christophe Reutenauer:
Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings. Lecture Notes in Computer Science 9840, Springer 2016, ISBN 978-3-662-53131-0 [contents] - 2015
- [c17]Srecko Brlek, Nadia Lafrenière, Xavier Provençal:
Palindromic Complexity of Trees. DLT 2015: 155-166 - 2014
- [j41]Srecko Brlek, Nadia Lafrenière:
Reconstructing Words from a σ-palindromic Language. Fundam. Informaticae 135(1-2): 59-72 (2014) - [j40]Hugo Tremblay, Gilbert Labelle, Srecko Brlek, Alexandre Blondin Massé:
Exhaustive generation of atomic combinatorial differential operators. Theor. Comput. Sci. 536: 62-69 (2014) - [c16]Srecko Brlek, Hugo Tremblay, Jérôme Tremblay, Romaine Weber:
Efficient Computation of the Outer Hull of a Discrete Path. DGCI 2014: 122-133 - 2013
- [j39]Srecko Brlek, Christophe Reutenauer, Jean-Guy Penaud:
Generation of Combinatorial Structures. Theor. Comput. Sci. 502: 1-3 (2013) - 2012
- [j38]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): 1011-1018 (2012) - [j37]Srecko Brlek, Jean-Philippe Labbé, Michel Mendès France:
Combinatorial variations on Cantorʼs diagonal. J. Comb. Theory A 119(3): 655-667 (2012) - 2011
- [j36]Srecko Brlek, Xavier Provençal:
Discrete geometry for computer imagery. Pattern Recognit. Lett. 32(9): 1355 (2011) - [j35]Srecko Brlek, Christophe Reutenauer:
Complexity and palindromic defect of infinite words. Theor. Comput. Sci. 412(4-5): 493-497 (2011) - [j34]Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé:
Equations on palindromes and circular words. Theor. Comput. Sci. 412(27): 2922-2930 (2011) - [j33]Srecko Brlek, Xavier Provençal:
Advances in discrete geometry. Theor. Comput. Sci. 412(36): 4755-4756 (2011) - [j32]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) - [j31]Srecko Brlek, Michel Koskas, Xavier Provençal:
A linear time and space algorithm for detecting path intersection in Zd. Theor. Comput. Sci. 412(36): 4841-4850 (2011) - [j30]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon:
Palindromic complexity of codings of rotations. Theor. Comput. Sci. 412(46): 6455-6463 (2011) - [c15]Srecko Brlek:
Interactions between Digital Geometry and Combinatorics on Words. WORDS 2011: 1-12
2000 – 2009
- 2009
- [j29]Srecko Brlek, Xavier Provençal, Jean-Marc Fedou:
On the tiling by translation problem. Discret. Appl. Math. 157(3): 464-475 (2009) - [j28]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon:
Codings of rotations on two intervals are full. Electron. Notes Discret. Math. 34: 289-293 (2009) - [j27]Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer:
Lyndon + Christoffel = digitally convex. Pattern Recognit. 42(10): 2239-2246 (2009) - [c14]Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé:
Christoffel and Fibonacci Tiles. DGCI 2009: 67-78 - [c13]Srecko Brlek, Michel Koskas, Xavier Provençal:
A Linear Time and Space Algorithm for Detecting Path Intersection. DGCI 2009: 397-408 - [c12]Elena Barcucci, Srecko Brlek, Stefano Brocchi:
PCIF: An Algorithm for Lossless True Color Image Compression. IWCIA 2009: 224-237 - [e1]Srecko Brlek, Christophe Reutenauer, Xavier Provençal:
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 [contents] - 2008
- [j26]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Shuffle operations on discrete paths. Theor. Comput. Sci. 391(1-2): 75-89 (2008) - [j25]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) - [j24]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Discrete sets with minimal moment of inertia. Theor. Comput. Sci. 406(1-2): 31-42 (2008) - [c11]Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal:
Combinatorial View of Digital Convexity. DGCI 2008: 57-68 - [c10]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
On Minimal Moment of Inertia Polyominoes. DGCI 2008: 299-309 - [c9]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 - 2007
- [j23]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) - [j22]Srecko Brlek, Guy Melançon, Geneviève Paquin:
Properties of the Extremal Infinite Smooth Words. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j21]Srecko Brlek, Christophe Reutenauer:
Preface. Theor. Comput. Sci. 380(3): 219 (2007) - [c8]Srecko Brlek, Sardaouna Hamadou, John Mullins:
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols. SecCO@CONCUR 2007: 61-83 - [i1]Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé:
On the critical exponent of generalized Thue-Morse words. CoRR abs/0710.4031 (2007) - 2006
- [j20]Srecko Brlek, Elisa Pergola, Olivier Roques:
Non uniform random generation of generalized Motzkin paths. Acta Informatica 42(8-9): 603-616 (2006) - [j19]Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
Tilings by Translation: Enumeration by a Rational Language Approach. Electron. J. Comb. 13(1) (2006) - [j18]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Properties of the Contour Path of Discrete Sets. Int. J. Found. Comput. Sci. 17(3): 543-556 (2006) - [j17]Srecko Brlek, Sardaouna Hamadou, John Mullins:
A flaw in the electronic commerce protocol SET. Inf. Process. Lett. 97(3): 104-108 (2006) - [j16]Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon:
Combinatorial properties of smooth infinite words. Theor. Comput. Sci. 352(1-3): 306-317 (2006) - [c7]Srecko Brlek, Sardaouna Hamadou, John Mullins:
Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET. AICT/ICIW 2006: 119 - [c6]Srecko Brlek, Xavier Provençal:
An Optimal Algorithm for Detecting Pseudo-squares. DGCI 2006: 403-412 - [c5]Srecko Brlek, Xavier Provençal:
On the problem of deciding if a polyomino tiles the plane by translation. Stringology 2006: 65-76 - 2005
- [j15]Srecko Brlek, Sardaouna Hamadou, John Mullins:
Anonymous and Secure Electronic Transaction protocol. Ann. des Télécommunications 60(5-6): 530-557 (2005) - [j14]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Algorithms for polyominoes based on the discrete Green theorem. Discret. Appl. Math. 147(2-3): 187-205 (2005) - [j13]Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi:
On the equivalence problem for succession rules. Discret. Math. 298(1-3): 142-154 (2005) - [j12]Valérie Berthé, Srecko Brlek, Philippe Choquette:
Smooth words over arbitrary alphabets. Theor. Comput. Sci. 341(1-3): 293-310 (2005) - [j11]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) - [c4]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
A Note on a Result of Daurat and Nivat. Developments in Language Theory 2005: 189-198 - 2004
- [j10]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) - 2003
- [j9]Srecko Brlek, Christophe Reutenauer:
On a valuation of rational subsets of Zk Dédié à Jean Berstel. Theor. Comput. Sci. 292(1): 85-96 (2003) - [j8]Srecko Brlek, A. Ladouceur:
A note on differentiable palindromes. Theor. Comput. Sci. 302(1-3): 167-178 (2003) - [c3]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Incremental Algorithms Based on Discrete Green Theorem. DGCI 2003: 277-287
1990 – 1999
- 1995
- [j7]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): 455-461 (1995) - [j6]Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette:
On-Line Evaluation of Powers Using Euclid's Algorithm. RAIRO Theor. Informatics Appl. 29(5): 431-450 (1995) - [j5]André Arnold, Srecko Brlek:
Automatic Verification of Properties in Transition Systems. Softw. Pract. Exp. 25(6): 579-596 (1995) - 1994
- [c2]Srecko Brlek, Antoine Rauzy:
Synchronization of Constrained Transition Systems. PASCO 1994: 54-62 - 1991
- [c1]Srecko Brlek, Pierre Castéran, Robert Strandh:
On Addition Schemes. TAPSOFT, Vol.2 1991: 379-393
1980 – 1989
- 1989
- [j4]Srecko Brlek:
Enumeration of factors in the Thue-Morse word. Discret. Appl. Math. 24(1-3): 83-96 (1989) - [j3]André Arnold, Srecko Brlek:
Optimal Word Chains for the Thue-Morse Word. Inf. Comput. 83(2): 140-151 (1989) - [j2]François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc:
Addition Chains Using Continued Fractions. J. Algorithms 10(3): 403-412 (1989) - 1987
- [j1]Jean Berstel, Srecko Brlek:
On the Length of Word Chains. Inf. Process. Lett. 26(1): 23-28 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
