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=339
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Avoiding large squares in infinite binary words
Narad Rampersad
,
Jeffrey Shallit
,
Ming-wei Wang
Theoretical Computer Science
339
(1), 2005, pp. 19-34
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
On the power of Ambainis lower bounds
Shengyu Zhang
Theoretical Computer Science
339
(2-3), 2005, pp. 241-256
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
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
Cristina Bazgan
,
Bruno Escoffier
,
Vangelis Th. Paschos
Theoretical Computer Science
339
(2-3), 2005, pp. 272-292
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
Yong He
,
Yiwei Jiang
Theoretical Computer Science
339
(2-3), 2005, pp. 293-314
Short length Menger's theorem and reliable optical routing
Amitabha Bagchi
,
Amitabh Chaudhary
,
Petr Kolman
Theoretical Computer Science
339
(2-3), 2005, pp. 315-332
On queuing lengths in on-line switching
Peter Damaschke
,
Zhen Zhou
Theoretical Computer Science
339
(2-3), 2005, pp. 333-343
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
Murray Elder
Theoretical Computer Science
339
(2-3), 2005, pp. 344-371