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=78
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
B. Courcelle
,
P. Deransart
Information and Computation
78
(1), 1988, pp. 1-55
Tape versus queue and stacks: The lower bounds
Ming Li
,
Paul M. Vitányi
Information and Computation
78
(1), 1988, pp. 56-85
Promise problems complete for complexity classes
Alan L. Selman
Information and Computation
78
(2), 1988, pp. 87-98
On the limits of computations with the floor function
László Babai
,
Bettina Just
,
Friedhelm Meyer auf der Heide
Information and Computation
78
(2), 1988, pp. 99-107
The computational complexity of asymptotic problems I: Partial Orders
Kevin J. Compton
Information and Computation
78
(2), 1988, pp. 108-123
Algorithms for determining relative star height and star height
Kosaburo Hashiguchi
Information and Computation
78
(2), 1988, pp. 124-169
A fast algorithm for computing multiplicative inverses in GF(
2^m
) using normal bases
Toshiya Itoh
,
Shigeo Tsujii
Information and Computation
78
(3), 1988, pp. 171-177
Complexity characterizations of attribute grammar languages
Sophocles Efremidis
,
Christos H. Papadimitriou
,
Martha Sideris
Information and Computation
78
(3), 1988, pp. 178-186
The OI-hierarchy is closed under control
Heiko Vogler
Information and Computation
78
(3), 1988, pp. 187-204
Global renaming operators in concrete process algebra
J.C.M. Baeten
,
J.A. Bergstra
Information and Computation
78
(3), 1988, pp. 205-245
Some remarks on computing the square parts of integers
Susan Landau
Information and Computation
78
(3), 1988, pp. 246-253