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=Acta Inf. AND YEAR=1982
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some modified algorithms for Dijkstra's longest upsequence problem
R.B.K. Dewar
,
S.M. Merritt
,
M. Sharir
Acta Informatica
18
(1), 1982, pp. 1-15
Optimum reorganization points for arbitrary database costs
R.J. Ramirez
,
F.W. Tompa
,
J.I. Munro
Acta Informatica
18
(1), 1982, pp. 17-30
Two notions of correctness and their relation to testing
T.A. Budd
,
D. Angluin
Acta Informatica
18
(1), 1982, pp. 31-45
Partial abstract types
M. Broy
,
M. Wirsing
Acta Informatica
18
(1), 1982, pp. 47-64
Saturated languages and decreasing cones, bifaithful languages and bifaithful cones
J. Leguy
Acta Informatica
18
(1), 1982, pp. 65-78
On termination problems for finitely interpreted ALGOL-like programs
H. Langmaack
Acta Informatica
18
(1), 1982, pp. 79-108
On the Hotz group of a context-free grammar
C. Frougny
,
J. Sakarovitch
,
E. Valkema
Acta Informatica
18
(1), 1982, pp. 109-115
Deterministic buffer synchronization of sequential processes
W. Reisig
Acta Informatica
18
(2), 1982, pp. 117-134
Further analysis of code generation for a single register machine
L.R. Carter
Acta Informatica
18
(2), 1982, pp. 135-147
Verification of programs with procedure-type parameters
G.W. Ernst
,
J.K. Navlakha
,
W.F. Ogden
Acta Informatica
18
(2), 1982, pp. 149-169
A longest common subsequence algorithm suitable for similar text strings
N. Nakatsu
,
Y. Kambayashi
,
S. Yajima
Acta Informatica
18
(2), 1982, pp. 171-179
Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique
A. Pettorossi
,
R.M. Burstall
Acta Informatica
18
(2), 1982, pp. 181-206
Lower bounds for on-line two-dimensional packing algorithms
D.J. Brown
,
B.S. Baker
,
H.P. Katseff
Acta Informatica
18
(2), 1982, pp. 207-225
Logic for improving integrity checking in relational data bases
J.-M. Nicolas
Acta Informatica
18
(3), 1982, pp. 227-253
On the costs of optimal and near-optimal binary search trees
B. Allen
Acta Informatica
18
(3), 1982, pp. 255-263
A denotational framework for data flow analysis
F. Nielson
Acta Informatica
18
(3), 1982, pp. 265-287
An alternative implementation of an insertion-only recovery technique
S.O. Anderson
,
R.C. Backhouse
Acta Informatica
18
(3), 1982, pp. 289-298
On the complexity of some problems concerning the use of procedures. I
K. Winklmann
Acta Informatica
18
(3), 1982, pp. 299-318
On an exponential server with general cyclic arrivals
A.K. Agrawala
,
S.K. Tripathi
Acta Informatica
18
(3), 1982, pp. 319-334
A theory of interactive programming
T. Gergely
,
L. Ury
Acta Informatica
17
(1), 1982, pp. 1-20
Synchronized behaviours of processes and rational relations
A. Arnold
Acta Informatica
17
(1), 1982, pp. 21-29
Scheduling with slack time
C.L. Liu
,
J.W.S. Liu
,
A.L. Liestman
Acta Informatica
17
(1), 1982, pp. 31-41
Information theoretic approximations for m/g/1 and g/g1 queueing systems
J.E. Shore
Acta Informatica
17
(1), 1982, pp. 43-61
A hierarchy theorem for multihead stack-counter automata
S. Miyano
Acta Informatica
17
(1), 1982, pp. 63-67
Vompleteness of e0l forms is decidable
G. Rozenberg
,
R. Verraedt
Acta Informatica
17
(1), 1982, pp. 69-87
Seiten 1
2
>