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=281
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Une brève biographie scientifique de Maurice Nivat
Pierre-Louis Curien
Theoretical Computer Science
281
(1-2), 2002, pp. 3-23
ICALP, EATCS and Maurice Nivat
Grzegorz Rozenberg
,
Arto Salomaa
Theoretical Computer Science
281
(1-2), 2002, pp. 25-30
Nivat's processes and their synchronization
André Arnold
Theoretical Computer Science
281
(1-2), 2002, pp. 31-36
Basic analytic combinatorics of directed lattice paths
Cyril Banderier
,
Philippe Flajolet
Theoretical Computer Science
281
(1-2), 2002, pp. 37-80
Groups and tilings
Danièle Beauquier
,
Jean-Claude Fournier
Theoretical Computer Science
281
(1-2), 2002, pp. 81-97
Coding rotations on intervals
Jean Berstel
,
Laurent Vuillon
Theoretical Computer Science
281
(1-2), 2002, pp. 99-107
Noninterference for concurrent programs and thread systems
Gérard Boudol
,
Ilaria Castellani
Theoretical Computer Science
281
(1-2), 2002, pp. 109-130
Dynamic connectors for concurrency
Roberto Bruni
,
Ugo Montanari
Theoretical Computer Science
281
(1-2), 2002, pp. 131-176
The evaluation of first-order substitution is monadic second-order compatible
Bruno Courcelle
,
Teodor Knapik
Theoretical Computer Science
281
(1-2), 2002, pp. 177-206
Tilings as a programming exercise
Guy Cousineau
Theoretical Computer Science
281
(1-2), 2002, pp. 207-217
Réduction de la non-linéarité des morphismes d'arbres recognizable tree-languages and non-linear morphisms
Max Dauchet
,
Sophie Tison
,
Marc Tommasi
Theoretical Computer Science
281
(1-2), 2002, pp. 219-233
Reconstructing permutation matrices from diagonal sums
Alberto Del Lungo
Theoretical Computer Science
281
(1-2), 2002, pp. 235-249
Reconnaissance parallèle des langages rationnels sur automates cellulaires plans
Marianne Delorme
,
Jacques Mazoyer
Theoretical Computer Science
281
(1-2), 2002, pp. 251-289
Counting
H
-colorings of partial
k
-trees
Josep Díaz
,
Maria Serna
,
Dimitrios M. Thilikos
Theoretical Computer Science
281
(1-2), 2002, pp. 291-309
De la logique aux pavages
Bruno Durand
Theoretical Computer Science
281
(1-2), 2002, pp. 311-324
Gene assembly through cyclic graph decomposition
A. Ehrenfeucht
,
T. Harju
,
G. Rozenberg
Theoretical Computer Science
281
(1-2), 2002, pp. 325-349
An algebraic characterization of the set of succession rules
Luca Farrari
,
Elisa Pergola
,
Renzo Pinzani
,
Simone Rinaldi
Theoretical Computer Science
281
(1-2), 2002, pp. 351-367
A truly concurrent semantics for a process algebra using resource pomsets
Paul Gastin
,
Michael Mislove
Theoretical Computer Science
281
(1-2), 2002, pp. 369-421
Modelization of deterministic rational relations
Serge Grigorieff
Theoretical Computer Science
281
(1-2), 2002, pp. 423-453
On the algorithmic inversion of the discrete Radon transform
Peter Gritzmann
,
Sven de Vries
Theoretical Computer Science
281
(1-2), 2002, pp. 455-469
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics
Mitsuhiro Okada
Theoretical Computer Science
281
(1-2), 2002, pp. 471-498
A unified language processing methodology
Teodor Rus
Theoretical Computer Science
281
(1-2), 2002, pp. 499-536
Uni-transitional Watson-Crick D0L systems
Arto Salomaa
Theoretical Computer Science
281
(1-2), 2002, pp. 537-553
L(A) = L(B)?
A simplified decidability proof
Géraud Sénizergues
Theoretical Computer Science
281
(1-2), 2002, pp. 555-608
Śrī Yantra Geometry
Gérard Huet
Theoretical Computer Science
281
(1-2), 2002, pp. 609-628