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=224
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Note on the generalization of calculations
Matthias Baaz
Theoretical Computer Science
224
(1-2), 1999, pp. 3-11
Parameter free induction and provably total computable functions
Lev D. Beklemishev
Theoretical Computer Science
224
(1-2), 1999, pp. 13-33
The monadic second-order logic of graphs XI: Hierarchical decompositions of connected graphs
Bruno Courcelle
Theoretical Computer Science
224
(1-2), 1999, pp. 35-58
On
d
-spaces
Yu.L. Ershov
Theoretical Computer Science
224
(1-2), 1999, pp. 59-72
On logics with two variables
Erich Grädel
,
Martin Otto
Theoretical Computer Science
224
(1-2), 1999, pp. 73-113
An algebraic correctness criterion for intuitionistic multiplicative proof nets
Philippe de Groote
Theoretical Computer Science
224
(1-2), 1999, pp. 115-134
Temporal aspects of the modal logic of subset spaces
Bernhard Heinemann
Theoretical Computer Science
224
(1-2), 1999, pp. 135-155
From multiple sequent for additive linear logic to decision procedures for free lattices
Jean-Yves Marion
Theoretical Computer Science
224
(1-2), 1999, pp. 157-172
Linear ordering on graphs, anti-founded sets and polynomial time computability
Alexei Lisitsa
,
Vladimir Sazonov
Theoretical Computer Science
224
(1-2), 1999, pp. 173-213
Solving word equations modulo partial commutations
Volker Diekert
,
Yuri Matiyasevich
,
Anca Muscholl
Theoretical Computer Science
224
(1-2), 1999, pp. 215-235
Bisimulation-invariant PTIME and higher-dimensional
\mu
-calculus
Martin Otto
Theoretical Computer Science
224
(1-2), 1999, pp. 237-265
A PSPACE-complete fragment of second-order linear logic
G. Perrier
Theoretical Computer Science
224
(1-2), 1999, pp. 267-289
A formalization of reasoning not derived from standard predicate logic
Gregory S. Tseytin
Theoretical Computer Science
224
(1-2), 1999, pp. 291-317
Simultaneous rigid
E
-unification and other decision problems related to the Herbrand theorem
Andrei Voronkov
Theoretical Computer Science
224
(1-2), 1999, pp. 319-352