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=318
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An arithmetic for non-size-increasing polynomial-time computation
Klaus Aehlig
,
Ulrich Berger
,
Martin Hofmann
,
Helmut Schwichtenberg
Theoretical Computer Science
318
(1-2), 2004, pp. 3-27
Stratified coherence spaces: A denotational semantics for light linear logic
Patrick Baillot
Theoretical Computer Science
318
(1-2), 2004, pp. 29-55
Separating
NC
along the
\delta
axis
S. Bellantoni
,
I. Oitavem
Theoretical Computer Science
318
(1-2), 2004, pp. 57-78
Automated higher-order complexity analysis
Ralph Benzinger
Theoretical Computer Science
318
(1-2), 2004, pp. 79-103
Minimization and
NP
multifunctions
N. Danner
,
C. Pollett
Theoretical Computer Science
318
(1-2), 2004, pp. 105-119
Realizability models for BLL-like languages
M. Hofmann
,
P.J. Scott
Theoretical Computer Science
318
(1-2), 2004, pp. 121-137
On the computational complexity of imperative programming languages
L. Kristiansen
,
K.-H. Niggl
Theoretical Computer Science
318
(1-2), 2004, pp. 139-161
Soft linear logic and polynomial time
Yves Lafont
Theoretical Computer Science
318
(1-2), 2004, pp. 163-180
Intrinsic reasoning about functional programs II: Unipolar induction and primitive-recursion
Daniel Leivant
Theoretical Computer Science
318
(1-2), 2004, pp. 181-196
On an interpretation of safe recursion in light affine logic
A.S. Murawski
,
C.-H.L. Ong
Theoretical Computer Science
318
(1-2), 2004, pp. 197-223
On the computational complexity of Longley's
H
functional
James S. Royer
Theoretical Computer Science
318
(1-2), 2004, pp. 225-241
Towards the hierarchical verification of reactive systems
Mila Majster-Cederbaum
,
Frank Salger
Theoretical Computer Science
318
(3), 2004, pp. 243-296
Optimal paths in weighted timed automata
Rajeev Alur
,
Salvatore la Torre
,
George J. Pappas
Theoretical Computer Science
318
(3), 2004, pp. 297-322
Metrics for labelled Markov processes
Josée Desharnais
,
Vineet Gupta
,
Radha Jagadeesan
,
Prakash Panangaden
Theoretical Computer Science
318
(3), 2004, pp. 323-354
Continuous monoids and semirings
Georg Karner
Theoretical Computer Science
318
(3), 2004, pp. 355-372
The decidability of a fragment of BB'IW-logic
Sabine Broda
,
Luís Damas
,
Marcelo Finger
,
Paulo Silva e Silva
Theoretical Computer Science
318
(3), 2004, pp. 373-408
Phase semantics and decidability of elementary affine logic
Ugo Dal Lago
,
Simone Martini
Theoretical Computer Science
318
(3), 2004, pp. 409-433
A geometric interpretation of
LD
-resolution
R.N. Banerjee
,
A. Bujosa
Theoretical Computer Science
318
(3), 2004, pp. 435-470