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=391
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On undecidability bounds for matrix decision problems
Paul Bell
,
Igor Potapov
Theoretical Computer Science
391
(1-2), 2008, pp. 3-13
Multiple constraints on three and four words
Elena Czeizler
Theoretical Computer Science
391
(1-2), 2008, pp. 14-19
Cobham-Semenov theorem and
N^d
-subshifts
F. Durand
Theoretical Computer Science
391
(1-2), 2008, pp. 20-38
Self-dual tilings with respect to star-duality
D. Frettlöh
Theoretical Computer Science
391
(1-2), 2008, pp. 39-50
A characterization of fine words over a finite alphabet
Amy Glen
Theoretical Computer Science
391
(1-2), 2008, pp. 51-60
Cancellation and periodicity properties of iterated morphisms
Juha Honkala
Theoretical Computer Science
391
(1-2), 2008, pp. 61-64
Regular languages and their generating functions: The inverse problem
Christoph Koutschan
Theoretical Computer Science
391
(1-2), 2008, pp. 65-74
Shuffle operations on discrete paths
S. Brlek
,
G. Labelle
,
A. Lacasse
Theoretical Computer Science
391
(1-2), 2008, pp. 75-89
Completing circular codes in regular submonoids
Jean Néraud
Theoretical Computer Science
391
(1-2), 2008, pp. 90-98
An algorithm for recognition of
n
-collapsing words
I.V. Petrov
Theoretical Computer Science
391
(1-2), 2008, pp. 99-108
Generalized approximate counting revisited
Guy Louchard
,
Helmut Prodinger
Theoretical Computer Science
391
(1-2), 2008, pp. 109-125
Words avoiding repetitions in arithmetic progressions
Jui-Yi Kao
,
Narad Rampersad
,
Jeffrey Shallit
,
Manuel Silva
Theoretical Computer Science
391
(1-2), 2008, pp. 126-137
A conversion algorithm based on the technique of singularization
B. Schratzberger
Theoretical Computer Science
391
(1-2), 2008, pp. 138-149
Simple permutations: Decidability and unavoidable substructures
Robert Brignall
,
Nik Rus̑kuc
,
Vincent Vatter
Theoretical Computer Science
391
(1-2), 2008, pp. 150-163
Symmetrized
\beta
-integers
Julien Bernat
Theoretical Computer Science
391
(1-2), 2008, pp. 164-177
On periodicity of two-dimensional words
S.A. Puzynina
,
S.V. Avgustinovich
Theoretical Computer Science
391
(1-2), 2008, pp. 178-187
On process rate semantics
Luca Cardelli
Theoretical Computer Science
391
(3), 2008, pp. 190-215
A multiset-based model of synchronizing agents: Computability and robustness
Matteo Cavaliere
,
Radu Mardare
,
Sean Sedwards
Theoretical Computer Science
391
(3), 2008, pp. 216-238
Probabilistic model checking of complex biological pathways
John Heath
,
Marta Kwiatkowska
,
Gethin Norman
,
David Parker
,
Oksana Tymchyshyn
Theoretical Computer Science
391
(3), 2008, pp. 239-257
Temporal constraints in the logical analysis of regulatory networks
Heike Siebert
,
Alexander Bockmayr
Theoretical Computer Science
391
(3), 2008, pp. 258-275
GemCell: A generic platform for modeling multi-cellular biological systems
Hila Amir-Kroll
,
Avital Sadot
,
Irun R. Cohen
,
David Harel
Theoretical Computer Science
391
(3), 2008, pp. 276-290