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 Volume=19
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An optimality theory of concurrency control for databases
H.T. Kung
,
C.H. Papadimitriou
Acta Informatica
19
(1), 1983, pp. 1-11
Transposition of large tabular data structures with applications to physical database organization. I. Transposition of tabular data structures
T. Tsuda
,
T. Sato
Acta Informatica
19
(1), 1983, pp. 13-33
Storage utilization in b*-trees with a generalized overflow technique
K. Kuspert
Acta Informatica
19
(1), 1983, pp. 35-55
Complexity of analyzing the synchronization structure of concurrent programs
R.N. Taylor
Acta Informatica
19
(1), 1983, pp. 57-84
The universe problem for unrestricted flow languages
K. Iwama
Acta Informatica
19
(1), 1983, pp. 85-96
Standard model semantics for DSL-a data type specification language
J.A. Bergstra
,
J. Terlouw
Acta Informatica
19
(1), 1983, pp. 97-113
Interpretation and reduction of attribute grammars
G. Filé
Acta Informatica
19
(2), 1983, pp. 115-150
The construction of operator interfaces based on logical input devices
G.E. Pfaff
Acta Informatica
19
(2), 1983, pp. 151-166
Transposition of large tabular data structures with applications to physical database organization. II. Applications to physical database organization
T. Tsuda
,
A. Urano
,
T. Sato
Acta Informatica
19
(2), 1983, pp. 167-182
New lower bounds on the formula size of Boolean functions
U. Schurfeld
Acta Informatica
19
(2), 1983, pp. 183-194
Fairness and related properties in transition systems-a temporal logic to deal with fairness
J.P. Queille
,
J. Sifakis
Acta Informatica
19
(3), 1983, pp. 195-220
The implementation of retention in a coroutine environment
J.P. Kearns
,
M.L. Soffa
Acta Informatica
19
(3), 1983, pp. 221-233
An operational semantics for specifications of abstract data types with error handling
G. Engels
,
U. Pletat
,
H.-D. Ehrich
Acta Informatica
19
(3), 1983, pp. 235-253
Computation sequences: a way to characterize classes of attribute grammars
H.R. Nielson
Acta Informatica
19
(3), 1983, pp. 255-268
Efficiency of universal parallel computers
F. Meyer auf der Heide
Acta Informatica
19
(3), 1983, pp. 269-296
On the number of relational operators necessary to compute certain functions of real variables
A. Schmitt
Acta Informatica
19
(3), 1983, pp. 297-304
Inferring multivalued dependencies from functional and join dependencies
M.Y. Vardi
Acta Informatica
19
(4), 1983, pp. 305-324
Three measures for synchronic dependence in Petri nets
I. Suzuki
,
T. Kasami
Acta Informatica
19
(4), 1983, pp. 325-338
A maximum entropy analysis of the m/g/1 and g/m/1 queueing systems at equilibrium
M.A. El-Affendi
,
D.D. Kouvatsos
Acta Informatica
19
(4), 1983, pp. 339-355
On some variants of Post's correspondence problem
K. Ruohonen
Acta Informatica
19
(4), 1983, pp. 357-367
An efficient incremental LR parser for grammars with epsilon productions
R. Agrawal
,
K.D. Detro
Acta Informatica
19
(4), 1983, pp. 369-376
One-way multihead deterministic finite automata
J. Hromkovic̑
Acta Informatica
19
(4), 1983, pp. 377-384
A lower time bound for the knapsack problem on random access machines
P. Klein
,
F. Meyer auf der Heide
Acta Informatica
19
(4), 1983, pp. 385-395
Parallel language recognition in constant time by cellular automata
R. Sommerhalder
,
S.C. van Westrhenen
Acta Informatica
19
(4), 1983, pp. 397-407