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 YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Growth of repetition-free words - A review
Jean Berstel
Theoretical Computer Science
340
(2), 2005, pp. 280-290
Algebraic recognizability of regular tree languages
Zoltán Ésik
,
Pascal Weil
Theoretical Computer Science
340
(2), 2005, pp. 291-321
Commutation with codes
Juhani Karhumäki
,
Michel Latteux
,
Ion Petre
Theoretical Computer Science
340
(2), 2005, pp. 322-333
Palindromic factors of billiard words
J.-P. Borel
,
C. Reutenauer
Theoretical Computer Science
340
(2), 2005, pp. 334-348
Regular splicing languages and subclasses
Paola Bonizzoni
,
Giancarlo Mauri
Theoretical Computer Science
340
(2), 2005, pp. 349-363
Collage of two-dimensional words
Christian Choffrut
,
Berke Durak
Theoretical Computer Science
340
(2), 2005, pp. 364-380
Codes and sofic constraints
Marie-Pierre Béal
,
Dominique Perrin
Theoretical Computer Science
340
(2), 2005, pp. 381-393
Small size quantum automata recognizing some regular languages
Alberto Bertoni
,
Carlo Mereghetti
,
Beatrice Palano
Theoretical Computer Science
340
(2), 2005, pp. 394-407
New operations and regular expressions for two-dimensional languages over one-letter alphabet
Marcella Anselmo
,
Dora Giammarresi
,
Maria Madonia
Theoretical Computer Science
340
(2), 2005, pp. 408-431
Parsing with a finite dictionary
Julien Clément
,
Jean-Pierre Duval
,
Giovanna Guaiana
,
Dominique Perrin
,
Giuseppina Rindone
Theoretical Computer Science
340
(2), 2005, pp. 432-442
Compositional characterisations of
\lambda
-terms using intersection types
M. Dezani-Ciancaglini
,
F. Honsell
,
Y. Motohama
Theoretical Computer Science
340
(3), 2005, pp. 459-495
Subtractive reductions and complete problems for counting complexity classes
Arnaud Durand
,
Miki Hermann
,
Phokion G. Kolaitis
Theoretical Computer Science
340
(3), 2005, pp. 496-513
Radiocoloring in planar graphs: Complexity and approximations
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Theoretical Computer Science
340
(3), 2005, pp. 514-538
Divisibility problem for one relator monoids
S.I. Adian
Theoretical Computer Science
339
(1), 2005, pp. 3-6
Pattern avoidance: Themes and variations
James D. Currie
Theoretical Computer Science
339
(1), 2005, pp. 7-18
Space efficient search for maximal repetitions
Leszek Gaşsieniec
,
Roman Kolpakov
,
Igor Potapov
Theoretical Computer Science
339
(1), 2005, pp. 35-48
Generalised fine and Wilf's theorem for arbitrary number of periods
Sorin Constantinescu
,
Lucian Ilie
Theoretical Computer Science
339
(1), 2005, pp. 49-60
A proof of the extended Duval's conjecture
S̑tȇpán Holub
Theoretical Computer Science
339
(1), 2005, pp. 61-67
Sequences of linear arithmetical complexity
A.E. Frid
Theoretical Computer Science
339
(1), 2005, pp. 68-87
Sturmian words and a criterium by Michaux-Villemaire
Isabel M. Araújo
,
Véronique Bruyère
Theoretical Computer Science
339
(1), 2005, pp. 88-102
On a conjecture about finite fixed points of morphisms
F. Levé
,
G. Richomme
Theoretical Computer Science
339
(1), 2005, pp. 103-128
The algebra of binary search trees
F. Hivert
,
J.-C. Novelli
,
J.-Y. Thibon
Theoretical Computer Science
339
(1), 2005, pp. 129-165
Machine-based methods in parameterized complexity theory
Yijia Chen
,
Jörg Flum
,
Martin Grohe
Theoretical Computer Science
339
(2-3), 2005, pp. 167-199
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Andreas Maletti
Theoretical Computer Science
339
(2-3), 2005, pp. 200-240
The super connectivity of the pancake graphs and the super laceability of the star graphs
Cheng-Kuan Lin
,
Hua-Min Huang
,
Lih-Hsing Hsu
Theoretical Computer Science
339
(2-3), 2005, pp. 257-271
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>