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=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quantifier rank for parity of embedded finite models
Hervé Fournier
Theoretical Computer Science
295
(1-3), 2003, pp. 153-169
Space hierarchy theorem revised
Viliam Geffert
Theoretical Computer Science
295
(1-3), 2003, pp. 171-187
Converting two-way nondeterministic unary automata into simpler automata
Viliam Geffert
,
Carlo Mereghetti
,
Giovanni Pighizzini
Theoretical Computer Science
295
(1-3), 2003, pp. 189-203
The complexity of the characteristic and the minimal polynomial
Thanh Minh Hoang
,
Thomas Thierauf
Theoretical Computer Science
295
(1-3), 2003, pp. 205-222
On final coalgebras of continuous functors
Jiȓí Adámek
Theoretical Computer Science
294
(1-2), 2003, pp. 3-29
An equational notion of lifting monad
Anna Bucalo
,
Carsten Führmann
,
Alex Simpson
Theoretical Computer Science
294
(1-2), 2003, pp. 31-60
Restriction categories II: Partial map classification
J.R.B. Cockett
,
Stephen Lack
Theoretical Computer Science
294
(1-2), 2003, pp. 61-102
Combining word problems through rewriting in categories with products
Camillo Fiorentini
,
Silvio Ghilardi
Theoretical Computer Science
294
(1-2), 2003, pp. 103-149
Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
Thomas T. Hildebrandt
Theoretical Computer Science
294
(1-2), 2003, pp. 151-181
Towards a semantics of proofs for non-commutative logic: Multiplicatives and additives
V. Michele Abrusci
Theoretical Computer Science
294
(3), 2003, pp. 335-351
Computational isomorphisms in classical logic
Vincent Danos
,
Jean-Baptiste Joinet
,
Harold Schellinx
Theoretical Computer Science
294
(3), 2003, pp. 353-378
Coherence for sharing proof-nets
Stefano Guerrini
,
Simone Martini
,
Andrea Masini
Theoretical Computer Science
294
(3), 2003, pp. 379-409
Minimax-or feared value-
L^1/L^\infty
control
Pierre Bernhard
Theoretical Computer Science
293
(1), 2003, pp. 25-44
From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems
Jeremy Gunawardena
Theoretical Computer Science
293
(1), 2003, pp. 141-167
The max-plus algebra of the natural numbers has no finite equational basis
Luca Aceto
,
Zoltán Ésik
,
Anna Ingólfsdóttir
Theoretical Computer Science
293
(1), 2003, pp. 169-188
Application of Max-Plus algebra to biological sequence comparisons
J.-P Comet
Theoretical Computer Science
293
(1), 2003, pp. 189-217
Self-stabilization with path algebra
Bertrand Ducourthial
,
Sébastien Tixeuil
Theoretical Computer Science
293
(1), 2003, pp. 219-236
Dominance constraints with Boolean connectives: A model-eliminative treatment
Denys Duchier
Theoretical Computer Science
293
(2), 2003, pp. 321-343
Counting with range concatenation grammars
P. Boullier
Theoretical Computer Science
293
(2), 2003, pp. 391-416
Algebraic aspects of families of fuzzy languages
Peter R.J. Asveld
Theoretical Computer Science
293
(2), 2003, pp. 417-445
Compiling dyadic first-order specifications into map algebra
D. Cantone
,
A. Formisano
,
E.G. Omodeo
,
C.G. Zarba
Theoretical Computer Science
293
(2), 2003, pp. 447-475
Palindrome complexity
Jean-Paul Allouche
,
Michael Baake
,
Julien Cassaigne
,
David Damanik
Theoretical Computer Science
292
(1), 2003, pp. 9-31
A structural property of regular frequency computations
Holger Austinat
,
Volker Diekert
,
Ulrich Hertrampf
Theoretical Computer Science
292
(1), 2003, pp. 33-43
Squaring transducers: An efficient procedure for deciding functionality and sequentiality
Marie-Pierre Béal
,
Olivier Carton
,
Christophe Prieur
,
Jacques Sakarovitch
Theoretical Computer Science
292
(1), 2003, pp. 45-63
On probabilistic timed automata
Danièle Beauquier
Theoretical Computer Science
292
(1), 2003, pp. 65-84
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>