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=1977
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Concurrency of operations on b-trees
R. Bayer
,
M. Schkolnick
Acta Informatica
9
(1), 1977, pp. 1-21
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
D.T. Lee
,
C.K. Wong
Acta Informatica
9
(1), 1977, pp. 23-29
Eliminating unit productions from LR parsers
D. Pager
Acta Informatica
9
(1), 1977, pp. 31-59
Axioms for total correctness
S. Sokolowski
Acta Informatica
9
(1), 1977, pp. 61-71
A class of measures on formal languages
J. Paredaens
,
R. Vyncke
Acta Informatica
9
(1), 1977, pp. 73-86
Subrecursive complexities on groups. I. Groups of given complexity
J. Avenhaus
,
K. Madlener
Acta Informatica
9
(1), 1977, pp. 87-104
The parsing problem for affix grammars
D.A. Watt
Acta Informatica
8
(1), 1977, pp. 1-20
Proof of termination within a weak logic of programs
D.C. Luckham
,
N. Suzuki
Acta Informatica
8
(1), 1977, pp. 21-36
Extended directed graphs, a formalism for structured data and data structures
M.E. Majster
Acta Informatica
8
(1), 1977, pp. 37-59
Complete parameterized families of job scheduling strategies
I. Mitrani
,
J.H. Hine
Acta Informatica
8
(1), 1977, pp. 61-73
E0l forms
H.A. Maurer
,
A. Salomaa
,
D. Wood
Acta Informatica
8
(1), 1977, pp. 75-96
Language design methods based on semantic principles
R.D. Tennent
Acta Informatica
8
(2), 1977, pp. 97-112
On an equivalence between continuation and stack semantics
Bruce Russell
Acta Informatica
8
(2), 1977, pp. 113-123
Backtracking in recursive computations
N. Francez
,
B. Klebansky
,
A. Pnueli
Acta Informatica
8
(2), 1977, pp. 125-144
Rules of inference for procedure calls
G.W. Ernst
Acta Informatica
8
(2), 1977, pp. 145-152
Scheduling according to job priority with prevention of deadlock and permanent blocking
Bo Munch-Andersen
,
Torben U. Zahle
Acta Informatica
8
(2), 1977, pp. 153-175
Iterative arrays with direct central control
J.I. Seiferas
Acta Informatica
8
(2), 1977, pp. 177-192
Van Wijngaarden grammars and space complexity class exspace
P. Deussen
,
K. Mehlhorn
Acta Informatica
8
(2), 1977, pp. 193-199
Some extended semaphore primitives
T. Agerwala
Acta Informatica
8
(3), 1977, pp. 201-220
Locations considered unnecessary
J.E. Donahue
Acta Informatica
8
(3), 1977, pp. 221-242
LAR: A logic of algorithmic reasoning
F. Kröger
Acta Informatica
8
(3), 1977, pp. 243-266
General properties of derivational complexity
Y. Igarashi
Acta Informatica
8
(3), 1977, pp. 267-283
Iterated deterministic substitution
P.R.J. Asveld
,
J. Engelfriet
Acta Informatica
8
(3), 1977, pp. 285-302
On computing the transitive closure of a relation
J. Eve
,
R. Kurki-Suonio
Acta Informatica
8
(4), 1977, pp. 303-314
On a new approach to representation independent data classes
R.D. Tennent
Acta Informatica
8
(4), 1977, pp. 315-324
Seiten 1
2
>