Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Brlek, Sre{\v{c}}ko"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exhaustive generation of atomic combinatorial differential operators
Hugo Tremblay
,
Gilbert Labelle
,
Srec̑ko Brlek
,
Alexandre Blondin Massé
Theoretical Computer Science
536
, 2014, pp. 62-69
Generation of combinatorial structures
Srec̑ko Brlek
,
Christophe Reutenauer
,
Jean-Guy Penaud
Theoretical Computer Science
502
, 2013, pp. 1-3
Combinatorial variations on Cantor's diagonal
Srec̑ko Brlek
,
Jean-Philippe Labbé
,
Michel Mendès France
Journal of Combinatorial Theory Series A
119
(3), 2012, pp. 655-667
A linear time and space algorithm for detecting path intersection in
\mathbb Z^d
Srec̑ko Brlek
,
Michel Koskas
,
Xavier Provençal
Theoretical Computer Science
412
(36), 2011, pp. 4841-4850
Non uniform random generation of generalized Motzkin paths
Srec̑ko Brlek
,
Elisa Pergola
,
Olivier Roques
Acta Informatica
42
(8-9), 2006, pp. 603-616
Smooth words over arbitrary alphabets
Valérie Berthé
,
Srec̑ko Brlek
,
Philippe Choquette
Theoretical Computer Science
341
(1-3), 2005, pp. 293-310
On a valuation of rational subsets of
Z^k
- Dédié à Jean Berstel
Srec̑ko Brlek
,
Christoph Reutenauer
Theoretical Computer Science
292
(1), 2003, pp. 85-96