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=16
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of database graphs admitting a simple locking protocol
Z. Kedem
,
A. Silberschatz
Acta Informatica
16
(1), 1981, August, pp. 1-13
On the use of history variables
M. Clint
Acta Informatica
16
(1), 1981, August, pp. 15-30
Reliability theory of program testing
R. Hamlet
Acta Informatica
16
(1), 1981, August, pp. 31-43
Handling different integer representations by optimizing compilers
M. Stadel
Acta Informatica
16
(1), 1981, August, pp. 45-56
On the response time distribution in a discrete round-robin queue
R. Schassberger
Acta Informatica
16
(1), 1981, August, pp. 57-62
A characterization of context-free string languages by directed node-label controlled graph grammars
D. Janssens
,
G. Rozenberg
Acta Informatica
16
(1), 1981, August, pp. 63-85
Another look at the `longest ascending subsequence' problem
Paul Pritchard
Acta Informatica
16
(1), 1981, August, pp. 87-91
A formal model of atomicity in asynchronous systems
F. Best
,
B. Randell
Acta Informatica
16
(1), 1981, August, pp. 93-124
Parsing regular grammars with finite lookahead
T.J. Ostrand
,
M.C. Paull
,
E.J. Weyuker
Acta Informatica
16
(2), 1981, October, pp. 125-138
The
(n,k)
-bounded emptiness-problem for probabilistic acceptors and related problems
V. Claus
Acta Informatica
16
(2), 1981, October, pp. 139-160
Sound and complete Hoare-like calculi based on copy rules
E.-R. Olderog
Acta Informatica
16
(2), 1981, October, pp. 161-197
The clean termination of iterative programs
A. Blikle
Acta Informatica
16
(2), 1981, October, pp. 199-217
An axiomatic definition of synchronization primitives
A.J. Martin
Acta Informatica
16
(2), 1981, October, pp. 219-235
An analysis of two related loop-free algorithms for generating integer partitions
T.I. Fenner
,
G. Loizou
Acta Informatica
16
(2), 1981, October, pp. 237-252
Pathlistings applied to data flow analysis
Jayashree Ramanathan
,
Ken Kennedy
Acta Informatica
16
(3), 1981, November, pp. 253-273
The formal power of one-visit attribute grammars
J. Engelfriet
,
G. Filé
Acta Informatica
16
(3), 1981, November, pp. 275-302
Epsilon-productions in context-free grammars
L.M. Goldschlager
Acta Informatica
16
(3), 1981, November, pp. 303-308
The formal definition of a real-time language
J.L. Hennessy
,
R.B. Kieburtz
Acta Informatica
16
(3), 1981, November, pp. 309-345
A gap between the actual complexity of permutations and their entropy defined by Stoss
T. Klingler
Acta Informatica
16
(3), 1981, November, pp. 347-362
Best Huffman trees
G. Markowsky
Acta Informatica
16
(3), 1981, November, pp. 363-370
Problematic features of programming languages: a situational-calculus approach
Z. Manna
,
R. Waldinger
Acta Informatica
16
(4), 1981, December, pp. 371-426
A characterization of attribute evaluation in passes
H. Alblas
Acta Informatica
16
(4), 1981, December, pp. 427-464
Black-white pebbles and graph separation
T. Lengauer
Acta Informatica
16
(4), 1981, December, pp. 465-475