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: Journal=Theor.~Comput.~Sci. AND Volume=117
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sur la symétrie et l'asymétrie des structures combinatoires
Gilbert Labelle
Theoretical Computer Science
117
(1-2), 1993, pp. 3-22
Identities in search of identity
Doron Zeilberger
Theoretical Computer Science
117
(1-2), 1993, pp. 23-38
The operation
{}^{\uparrow}
on formal power series
Marcella Anselmo
Theoretical Computer Science
117
(1-2), 1993, pp. 39-43
Classification des cartes pointées de genre 1 et relation fonctionnelle associée
Didier Arques
,
Isabelle Jacques
Theoretical Computer Science
117
(1-2), 1993, pp. 45-65
Animaux et arbres guingois
J. Bétréma
,
J.G. Penaud
Theoretical Computer Science
117
(1-2), 1993, pp. 67-89
The Möbius function of factor order
Anders Björner
Theoretical Computer Science
117
(1-2), 1993, pp. 91-98
Average-case analysis on simple families of trees using a balanced probability model
R. Casas
,
J. Díaz
,
C. Martínez
Theoretical Computer Science
117
(1-2), 1993, pp. 99-112
Context-free grammars, differential operators and formal power series
William Y.C. Chen
Theoretical Computer Science
117
(1-2), 1993, pp. 113-129
Représentation symbolique d'espèces moléculaires
Yves Chiricota
Theoretical Computer Science
117
(1-2), 1993, pp. 131-136
Enumeration of generalized Young tableaux with bounded height
Seul Hee Choi
,
Dominique Gouyou-Beauchamps
Theoretical Computer Science
117
(1-2), 1993, pp. 137-151
Auto-similarité dans la combinatoire des polynômes orthogonaux
Ivan Constantineau
Theoretical Computer Science
117
(1-2), 1993, pp. 153-167
Séries indicatrices et
q
-séries
Hélène Décoste
Theoretical Computer Science
117
(1-2), 1993, pp. 169-186
Complexité d'algorithmes et opérations sur les arbres
S. Dulucq
,
S. Gire
Theoretical Computer Science
117
(1-2), 1993, pp. 187-198
A short, elementary, and easy, WZ proof of the Askey-Gasper inequality that was used by de Branges in his proof of the Bieberbach conjecture
Shalosh B. Ekhad
Theoretical Computer Science
117
(1-2), 1993, pp. 199-202
Sur une involution sur les chemins de Dyck
J.C. Lalanne
Theoretical Computer Science
117
(1-2), 1993, pp. 203-215
Bases de Lyndon des algèbres de Lie libres partiellement commutatives
Pierre Lalonde
Theoretical Computer Science
117
(1-2), 1993, pp. 217-226
Plane and projective meanders
S.K. Lando
,
A.K. Zvonkin
Theoretical Computer Science
117
(1-2), 1993, pp. 227-241
Sur la distribution des anti-excédances dans le groupe symétrique et dans ses sous-groupes
Roberto Mantaci
Theoretical Computer Science
117
(1-2), 1993, pp. 243-253
Constructions des bases standard des
K\langle A\rangle
-modules à droite
Guy Melançon
Theoretical Computer Science
117
(1-2), 1993, pp. 255-272
Combinatorial proofs of hook generating functions for skew plane partitions
Bruce E. Sagan
Theoretical Computer Science
117
(1-2), 1993, pp. 273-287
New plethysm operation, Chern characters of exterior and symmetric powers with applications to Stiefel-Whitney classes of grassmannians
Dragutin Svrtan
Theoretical Computer Science
117
(1-2), 1993, pp. 289-301
Sorting twice through a stack
Julian West
Theoretical Computer Science
117
(1-2), 1993, pp. 303-313