SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Srecko Brlek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Srecko Brlek, Sardaouna Hamadou, John Mullins
Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET. [Citation Graph (0, 0)][DBLP]
AICT/ICIW, 2006, pp:119- [Conf]
Srecko Brlek, Gilbert Labelle, Annie Lacasse
Incremental Algorithms Based on Discrete Green Theorem. [Citation Graph (0, 0)][DBLP]
DGCI, 2003, pp:277-287 [Conf]
Srecko Brlek, Xavier Provençal
An Optimal Algorithm for Detecting Pseudo-squares. [Citation Graph (0, 0)][DBLP]
DGCI, 2006, pp:403-412 [Conf]
Srecko Brlek, Gilbert Labelle, Annie Lacasse
A Note on a Result of Daurat and Nivat. [Citation Graph (0, 0)][DBLP]
Developments in Language Theory, 2005, pp:189-198 [Conf]
Srecko Brlek, Xavier Provençal
On the problem of deciding if a polyomino tiles the plane by translation. [Citation Graph (0, 0)][DBLP]
Stringology, 2006, pp:65-76 [Conf]
Srecko Brlek, Pierre Castéran, Robert Strandh
On Addition Schemes. [Citation Graph (0, 0)][DBLP]
TAPSOFT, Vol.2, 1991, pp:379-393 [Conf]
Srecko Brlek, Elisa Pergola, Olivier Roques
Non uniform random generation of generalized Motzkin paths. [Citation Graph (0, 0)][DBLP]
Acta Inf., 2006, v:42, n:8-9, pp:603-616 [Journal]
Srecko Brlek, Sardaouna Hamadou, John Mullins
Anonymous and Secure Electronic Transaction protocol. [Citation Graph (0, 0)][DBLP]
Annales des Télécommunications, 2005, v:60, n:5-6, pp:530-557 [Journal]
Srecko Brlek, Gilbert Labelle, Annie Lacasse
Algorithms for polyominoes based on the discrete Green theorem. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2005, v:147, n:2-3, pp:187-205 [Journal]
Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi
On the equivalence problem for succession rules. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2005, v:298, n:1-3, pp:142-154 [Journal]
André Arnold, Srecko Brlek
Optimal Word Chains for the Thue-Morse Word [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1989, v:83, n:2, pp:140-151 [Journal]
Srecko Brlek, Gilbert Labelle, Annie Lacasse
Properties of the Contour Path of Discrete Sets. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:543-556 [Journal]
Srecko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer
On The Palindromic Complexity Of Infinite Words. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 2004, v:15, n:2, pp:293-306 [Journal]
Jean Berstel, Srecko Brlek
On the Length of Word Chains. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1987, v:26, n:1, pp:23-28 [Journal]
Srecko Brlek, Sardaouna Hamadou, John Mullins
A flaw in the electronic commerce protocol SET. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2006, v:97, n:3, pp:104-108 [Journal]
Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette
On-Line Evaluation of Powers Using Euclid's Algorithm. [Citation Graph (0, 0)][DBLP]
ITA, 1995, v:29, n:5, pp:431-450 [Journal]
François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc
Addition Chains Using Continued Fractions. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1989, v:10, n:3, pp:403-412 [Journal]
André Arnold, Srecko Brlek
Automatic Verification of Properties in Transition Systems. [Citation Graph (0, 0)][DBLP]
Softw., Pract. Exper., 1995, v:25, n:6, pp:579-596 [Journal]
Valérie Berthé, Srecko Brlek, Philippe Choquette
Smooth words over arbitrary alphabets. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:341, n:1-3, pp:293-310 [Journal]
Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon
Combinatorial properties of smooth infinite words. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:352, n:1-3, pp:306-317 [Journal]
Srecko Brlek, A. Ladouceur
A note on differentiable palindromes. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:302, n:1-3, pp:167-178 [Journal]
Srecko Brlek, Gilbert Labelle, Annie Lacasse
The discrete Green Theorem and some applications in discrete geometry. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:346, n:2-3, pp:200-225 [Journal]
Srecko Brlek, Christophe Reutenauer
On a valuation of rational subsets of Z^k Dédié à Jean Berstel [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:292, n:1, pp:85-96 [Journal]
Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan
A relative of the Thue-Morse sequence. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:139, n:1-3, pp:455-461 [Journal]
Srecko Brlek, Christophe Reutenauer
Preface. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:380, n:3, pp:219- [Journal]
Combinatorial View of Digital Convexity. [Citation Graph (, )][DBLP]
On Minimal Moment of Inertia Polyominoes. [Citation Graph (, )][DBLP]
A Linear Time and Space Algorithm for Detecting Path Intersection. [Citation Graph (, )][DBLP]
Christoffel and Fibonacci Tiles. [Citation Graph (, )][DBLP]
Reconstructing words from a fixed palindromic length sequence. [Citation Graph (, )][DBLP]
PCIF: An Algorithm for Lossless True Color Image Compression. [Citation Graph (, )][DBLP]
Tilings by Translation: Enumeration by a Rational Language Approach. [Citation Graph (, )][DBLP]
On the tiling by translation problem. [Citation Graph (, )][DBLP]
Enumeration of factors in the Thue-Morse word. [Citation Graph (, )][DBLP]
On the Critical Exponent of Generalized Thue-Morse Words. [Citation Graph (, )][DBLP]
Properties of the Extremal Infinite Smooth Words. [Citation Graph (, )][DBLP]
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.304secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP