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
[1]
Hilfe
Suche: Author="Bergeron, F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combinatorics of labelled parallelogram polyominoes
J.-C. Aval
,
F. Bergeron
,
A. Garsia
Journal of Combinatorial Theory Series A
132
, 2015, pp. 32-57
Co-quasi-invariant spaces for generalized symmetric groups
J.-C. Aval
,
F. Bergeron
Journal of Combinatorial Theory Series A
119
(7), 2012, pp. 1432-1446
Computation of the expected number of leaves in a tree having a given automorphism, and related topics
F. Bergeron
,
G. Labelle
,
P. Leroux
Discrete Applied Mathematics
34
, 1991, pp. 49-66
Addition chains using continued fractions
F. Bergeron
,
J. Berstel
,
S. Brlek
,
C. Duboc
Journal of Algorithms
10
, 1989, pp. 403-412
Algorithms for sequential generation of combinatorial structures
F. Bergeron
Discrete Applied Mathematics
24
, 1989, pp. 29-35
Darwin
F. Bergeron
,
G. Cartier
Lecture Notes in Computer Science
294
, 1988, pp. 393-394
Functional equations for data structures
F. Bergeron
,
G. Labelle
,
P. Leroux
Lecture Notes in Computer Science
294
, 1988, pp. 73-80
DARWIN, a system designed for the study of enumerative combinatorics
F. Bergeron
,
C. Pichet
Lecture Notes in Computer Science
204
, 1985, pp. 444-445