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=Inf.~Comput. AND Volume=101
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Query languages for hierarchic databases
E. Dahlhaus
,
J.A. Makowsky
Information and Computation
101
(1), 1992, November, pp. 1-32
Tight complexity bounds for term matching problems
Rakesh M. Verma
,
I.V. Ramakrishnan
Information and Computation
101
(1), 1992, November, pp. 33-69
A lattice for abstract interpretation of dynamic (LISP-like) structures
Jan Stransky
Information and Computation
101
(1), 1992, November, pp. 70-102
A modal logic for cyclic repeating
Dimiter Vakarelov
Information and Computation
101
(1), 1992, November, pp. 103-122
k
versus
k+1
index registers and modifiable versus non-modifiable programs
K. Mehlhorn
,
W.J. Paul
,
C. Uhrig
Information and Computation
101
(1), 1992, November, pp. 123-129
String matching problems over free partially commutative monoids
Kosaburo Hashiguchi
,
Kazuya Yamada
Information and Computation
101
(2), 1992, December, pp. 131-149
Probabilistic logic programming
Raymond Ng
,
V.S. Subrahmanian
Information and Computation
101
(2), 1992, December, pp. 150-201
Characterizing complexity classes by general recursive dfinitions in higher types
Andreas Goerdt
Information and Computation
101
(2), 1992, December, pp. 202-218
Some results on the generalized star-height problem
J.E. Pin
,
H. Straubing
,
D. Thérien
Information and Computation
101
(2), 1992, December, pp. 219-250
Adding algebraic rewriting to the untyped lambda calculus
Daniel J. Dougherty
Information and Computation
101
(2), 1992, December, pp. 251-267