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=340
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Measuring the confinement of probabilistic systems
Alessandra di Pierro
,
Chris Hankin
,
Herbert Wiklicky
Theoretical Computer Science
340
(1), 2005, pp. 3-56
A computational interpretation of Dolev-Yao adversaries
Jonathan Herzog
Theoretical Computer Science
340
(1), 2005, pp. 57-81
Using data-independence in the analysis of intrusion detection systems
Gordon Thomas Rohrmair
,
Gavin Lowe
Theoretical Computer Science
340
(1), 2005, pp. 82-101
A semantics for web services authentication
Karthikeyan Bhargavan
,
Cédric Fournet
,
Andrew D. Gordon
Theoretical Computer Science
340
(1), 2005, pp. 102-153
Weakening the perfect encryption assumption in Dolev-Yao adversaries
Roberto Zunino
,
Pierpaolo Degano
Theoretical Computer Science
340
(1), 2005, pp. 154-178
Preface
A. de Luca
,
F. Mignosi
,
D. Perrin
,
G. Rozenberg
Theoretical Computer Science
340
(2), 2005, pp. 179-185
Connections between subwords and certain matrix mappings
Arto Salomaa
Theoretical Computer Science
340
(2), 2005, pp. 188-203
Words derivated from Sturmian words
Isabel M. Araújo
,
Véronique Bruyère
Theoretical Computer Science
340
(2), 2005, pp. 204-219
Codes of central Sturmian words
Arturo Carpi
,
Aldo de Luca
Theoretical Computer Science
340
(2), 2005, pp. 220-239
An enhanced property of factorizing codes
Clelia de Felice
Theoretical Computer Science
340
(2), 2005, pp. 240-256
Tile rewriting grammars and picture languages
Stefano Crespi Reghizzi
,
Matteo Pradella
Theoretical Computer Science
340
(2), 2005, pp. 257-272
Counting bordered and primitive words with a fixed weight
Tero Harju
,
Dirk Nowotka
Theoretical Computer Science
340
(2), 2005, pp. 273-279
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
A topological approach to transductions
Jean-Éric Pin
,
Pedro V. Silva
Theoretical Computer Science
340
(2), 2005, pp. 443-456
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
Seiten 1
2
>