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="Garsia, A."
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
Explicit formulas for a sequence of binary tree polynomials
M. D'Adderio
,
A.M. Garsia
Theoretical Computer Science
502
, 2013, pp. 217-226
R
r
-Qsym is free over Sym
A.M. Garsia
,
N. Wallach
Journal of Combinatorial Theory Series A
114
(4), 2007, pp. 704-732
Qsym over Sym is free
A.M. Garsia
,
N. Wallach
Journal of Combinatorial Theory Series A
104
(2), 2003, pp. 217-263
A random
q,t
-hook walk and a sum of Pieri coefficients
A.M. Garsia
,
M. Haiman
Journal of Combinatorial Theory Series A
82
(1), 1998, pp. 74-111
Combinatorial aspects of skew representations of the symmetric group
A.M. Garsia
,
M.L. Wachs
Journal of Combinatorial Theory Series A
50
, 1989, pp. 47-81
Q
-counting Rook configurations and a formula of Frobenius
A.M. Garsia
,
J.B. Remmel
Journal of Combinatorial Theory Series A
41
, 1986, pp. 246-275
Shuffles of permutations and the Kronecker product
A.M. Garsia
,
J. Remmel
Graphs and Combinatorics
1
, 1985, pp. 217-263
A Rogers-Ramanujan bijection
A.M. Garsia
,
S.C. Milne
Journal of Combinatorial Theory Series A
31
, 1981, pp. 289-339
A new algorithm for minimum cost binary trees
A.M. Garsia
,
M.L. Wachs
SIAM Journal on Computing
6
(4), 1977, December, pp. 622-642