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=293
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Conditions for the structural existence of an eigenvalue of a bipartite (min,max,+)-system
Jacob van der Woude
,
Subiono
Theoretical Computer Science
293
(1), 2003, pp. 13-24
Minimax-or feared value-
L^1/L^\infty
control
Pierre Bernhard
Theoretical Computer Science
293
(1), 2003, pp. 25-44
Disjunctive optimization, max-separable problems and extremal algebras
Karel Zimmermann
Theoretical Computer Science
293
(1), 2003, pp. 45-54
The finite power property in free groups
Flavio d'Alessandro
,
Jacques Sakarovitch
Theoretical Computer Science
293
(1), 2003, pp. 55-82
Some properties of recognizable
Z
-sibsets
Nami Kobayashi
Theoretical Computer Science
293
(1), 2003, pp. 83-113
A solution to the problem of
(A,B)
-invariance for series
Ines Klimann
Theoretical Computer Science
293
(1), 2003, pp. 115-139
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
A note on the strong and weak generative powers of formal systems
Aravind K. Joshi
Theoretical Computer Science
293
(2), 2003, pp. 243-259
An operational and denotational approach to non-context-freeness
Hans-Peter Kolb
,
Jens Michaelis
,
Uwe Mönnich
,
Frank Morawietz
Theoretical Computer Science
293
(2), 2003, pp. 261-289
wMSO theories as grammar formalism
James Rogers
Theoretical Computer Science
293
(2), 2003, pp. 291-320
Dominance constraints with Boolean connectives: A model-eliminative treatment
Denys Duchier
Theoretical Computer Science
293
(2), 2003, pp. 321-343
Structural similarity within and among languages
Edward P. Stabler
,
Edward L. Keenan
Theoretical Computer Science
293
(2), 2003, pp. 345-363
Tabular parsing and algebraic transformations
Karl-Michael Schneider
Theoretical Computer Science
293
(2), 2003, pp. 365-389
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
Finite automata on timed
\omega
-trees
Salvatore La Torre
,
Margherita Napoli
Theoretical Computer Science
293
(3), 2003, pp. 479-505
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic
qTL
Annabelle McIver
,
Carroll Morgan
Theoretical Computer Science
293
(3), 2003, pp. 507-534
Improved shortest path algorithms for nearly acyclic graphs
Shane Saunders
,
Tadao Takaoka
Theoretical Computer Science
293
(3), 2003, pp. 535-556
Precise goal-independent abstract interpretation of constraint logic programs
Peter Schachte
Theoretical Computer Science
293
(3), 2003, pp. 557-577