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=119
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Attributed tree grammars
Kablan Barbar
Theoretical Computer Science
119
(1), 1993, pp. 3-22
Type inference in Prolog: a new approach
M.-M. Corsini
,
K. Musumbu
Theoretical Computer Science
119
(1), 1993, pp. 23-38
Weighted systems of equations
Philippe Devienne
,
Patrick Lebègue
,
Max Dauchet
Theoretical Computer Science
119
(1), 1993, pp. 39-62
On the computational complexity of Prolog programs
A.Ja. Dikovsky
Theoretical Computer Science
119
(1), 1993, pp. 63-102
On a generalized product for domains
Walter Dosch
Theoretical Computer Science
119
(1), 1993, pp. 103-125
A complete modal proof system for HAL: the Herbrand agent language
Zineb Habbas
Theoretical Computer Science
119
(1), 1993, pp. 127-143
Computations in APS
A.A. Letichevsky
,
J.V. Kapitonova
,
S.V. Konozenko
Theoretical Computer Science
119
(1), 1993, pp. 145-171
Problem-oriented verification system and its application to linear algebra programs
V.A. Nepomniaschy
,
A.A. Sulimov
Theoretical Computer Science
119
(1), 1993, pp. 173-185
Hereditarily-finite sets, data bases and polynomial-time computability
Vladimir Yu. Sazonov
Theoretical Computer Science
119
(1), 1993, pp. 187-214
On fault tolerance of syntax
A.O. Slissenko
Theoretical Computer Science
119
(1), 1993, pp. 215-222
\Pi^1_1
-universality of some propositional logics of concurrent programs
M.K. Valiev
Theoretical Computer Science
119
(1), 1993, pp. 223-232
Stack versus sensitivity for one-way automata
Mirosƚaw Kutyƚowski
Theoretical Computer Science
119
(2), 1993, pp. 233-245
Efficient detection of quasiperiodicities in strings
Alberto Apostolico
,
Andrzej Ehrenfeucht
Theoretical Computer Science
119
(2), 1993, pp. 247-265
Partial orders on words, minimal elements of regular languages, and state complexity
Jean-Camille Birget
Theoretical Computer Science
119
(2), 1993, pp. 267-291
If not empty,
NP - P
is topologically large
Marius Zimand
Theoretical Computer Science
119
(2), 1993, pp. 293-310
Sequential compounds of combinatorial games
Walter Stromquist
,
Daniel Ullman
Theoretical Computer Science
119
(2), 1993, pp. 311-321
Snakes in domineering games
David Wolfe
Theoretical Computer Science
119
(2), 1993, pp. 323-329
Dynamic reachability in planar digraphs with one source and one sink
Roberto Tamassia
,
Ioannis G. Tollis
Theoretical Computer Science
119
(2), 1993, pp. 331-343
Additive cellular automata and algebraic series
B. Litow
,
Ph. Dumas
Theoretical Computer Science
119
(2), 1993, pp. 345-354
An optimal absorbing list organization strategy with constant memory requirements
B. John Oommen
,
David T.H. Ng
Theoretical Computer Science
119
(2), 1993, pp. 355-361
On the complexity of learning strings and sequences
Tao Jiang
,
Ming Li
Theoretical Computer Science
119
(2), 1993, pp. 363-371