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=307
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The ring of
k
-regular sequences, II
Jean-Paul Allouche
,
Jeffrey Shallit
Theoretical Computer Science
307
(1), 2003, pp. 3-29
Words whose complexity satisfies
lim\frac{p(n)}{n}=1
Ali Aberkane
Theoretical Computer Science
307
(1), 2003, pp. 31-46
Balances for fixed points of primitive substitutions
Boris Adamczewski
Theoretical Computer Science
307
(1), 2003, pp. 47-75
Image reducing words and subgroups of free groups
D.S. Ananichev
,
A. Cherubini
,
M.V. Volkov
Theoretical Computer Science
307
(1), 2003, pp. 77-92
On the entropy of regular languages
Tullio Ceccherini-Silberstein
,
Antonio Machì
,
Fabio Scarabotti
Theoretical Computer Science
307
(1), 2003, pp. 93-102
Growth-sensitivity of context-free languages
Tullio Ceccherini-Silberstein
,
Wolfgang Woess
Theoretical Computer Science
307
(1), 2003, pp. 103-116
Semiretracts - A counterexample and some results
Wit Foryś
,
Tomasz Krawczyk
,
James A. Anderson
Theoretical Computer Science
307
(1), 2003, pp. 117-127
On maximal synchronous codes
Yannick Guesnet
Theoretical Computer Science
307
(1), 2003, pp. 129-138
On the independence of equations in three variables
Tero Harju
,
Dirk Nowotka
Theoretical Computer Science
307
(1), 2003, pp. 139-172
Lyndon words, permutations and trees
Christophe Hohlweg
,
Christophe Reutenauer
Theoretical Computer Science
307
(1), 2003, pp. 173-178
Lyndon factorization of the Prouhet words
Patrice Séébold
Theoretical Computer Science
307
(1), 2003, pp. 179-197
The homomorphism problem for trace monoids
Pedro V. Silva
Theoretical Computer Science
307
(1), 2003, pp. 199-215
A generalization of the language of Łukasiewicz coding rooted planar hypermaps
Didier Arquès
,
Anne Micheli
Theoretical Computer Science
307
(2), 2003, pp. 221-239
Watermelon uniform random generation with applications
Nicolas Bonichon
,
Mohamed Mosbah
Theoretical Computer Science
307
(2), 2003, pp. 241-256
Walks confined in a quadrant are not always
D
-finite
Mireille Bousquet-Mélou
,
Marko Petkovs̑ek
Theoretical Computer Science
307
(2), 2003, pp. 257-276
Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti
Michel Bousquet
,
Cedric Chauve
,
Gilbert Labelle
,
Pierre Leroux
Theoretical Computer Science
307
(2), 2003, pp. 277-302
Generating and characterizing the perfect elimination orderings of a chordal graph
L.S. Chandran
,
L. Ibarra
,
F. Ruskey
,
J. Sawada
Theoretical Computer Science
307
(2), 2003, pp. 303-317
A bijection between directed column-convex polyominoes and ordered trees of height at most three
Emeric Deutsch
,
Helmut Prodinger
Theoretical Computer Science
307
(2), 2003, pp. 319-325
Some bijective results about the area of Schröder paths
L. Ferrari
,
E. Grazzini
,
E. Pergola
,
S. Rinaldi
Theoretical Computer Science
307
(2), 2003, pp. 327-335
A classification of plane and planar 2-trees
G. Labelle
,
C. Lamathe
,
P. Leroux
Theoretical Computer Science
307
(2), 2003, pp. 337-363
Graphs determined by polynomial invariants
Marc Noy
Theoretical Computer Science
307
(2), 2003, pp. 365-384
A bijection for triangulations of a polygon with interior points and multiple edges
Dominique Poulalhon
,
Gilles Schaeffer
Theoretical Computer Science
307
(2), 2003, pp. 385-401
Bijections and the Riordan group
Louis W. Shapiro
Theoretical Computer Science
307
(2), 2003, pp. 403-413
A loopless algorithm for generating the permutations of a multiset
Vincent Vajnovszki
Theoretical Computer Science
307
(2), 2003, pp. 415-431
On the number of hexagonal polyominoes
Markus Vöge
,
Anthony J. Guttmann
Theoretical Computer Science
307
(2), 2003, pp. 433-453
Seiten 1
2
>