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=1979
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Formal derivation of strongly correct concurrent programs
A. van Lamsweerde
,
M. Sintzoff
Acta Informatica
12
(1), 1979, pp. 1-31
Lower bounds on space complexity for contextfree recognition
H. Alt
Acta Informatica
12
(1), 1979, pp. 33-61
On the max-entropy rule for a binary search tree
Yasuichi Horibe
,
Tibor O.H. Nemetz
Acta Informatica
12
, 1979, pp. 63-72
Pascal - clarifications and recommended extensions
Jrgen Steensgaard-Madsen
Acta Informatica
12
(1), 1979, pp. 73-94
Generalized recursive data structures
W. Burton
Acta Informatica
12
(2), 1979, pp. 95-108
Cosy-a system specification language based on paths and processes
P.E. Lauer
,
M.W. Shields
,
P.R. Torrigiani
Acta Informatica
12
(2), 1979, pp. 109-158
Regenerative simulation of response times in networks of queues with multiple job types
Donald L. Iglehart
,
Gerald S. Shedler
Acta Informatica
12
(2), 1979, pp. 159-175
On languages accepted by space-bounded oracle machines
R.V. Book
Acta Informatica
12
(2), 1979, pp. 177-185
Generalized deterministic left to right parsing
C.J.M. Turnbull
,
E.S. Lee
Acta Informatica
12
(3), 1979, pp. 187-207
Computation and use of data flow information in optimizing compilers
R. Wilhelm
Acta Informatica
12
(3), 1979, pp. 209-225
Size-depth tradeoff in monotone Boolean formulae
B. Commentz-Walter
Acta Informatica
12
(3), 1979, pp. 227-243
The multiple phase service network with generalized processor sharing
J.W. Cohen
Acta Informatica
12
(3), 1979, pp. 245-284
Probabilistic models of computer systems. II. Diffusion approximations, waiting times and batch arrivals
E. Gelenbe
Acta Informatica
12
(4), 1979, pp. 285-303
On a class of recursive procedures and equivalent iterative ones
T. Hikita
Acta Informatica
12
(4), 1979, pp. 305-320
Analyse et optimisation d'une procédure de reprise dans un système de gestion de données centralisées
N. Mikou
,
S. Tucci
Acta Informatica
12
(4), 1979, pp. 321-338
A method for transforming grammars into LL(k) form
E. Soisalon-Soininen
,
E. Ukkonen
Acta Informatica
12
(4), 1979, pp. 339-369
Some remarks on Boolean sums
K. Mehlhorn
Acta Informatica
12
(4), 1979, pp. 371-375
Sequential method in propositional dynamic logic
H. Nishimura
Acta Informatica
12
(4), 1979, pp. 377-400
An experimentally validated model of the paging drum
C. Adams
,
E. Gelenbe
,
J. Vicard
Acta Informatica
11
(2), 1979, pp. 103-117
Constructing a theory of a data structure as an aid to program development
C.B. Jones
Acta Informatica
11
(2), 1979, pp. 119-137
Proof rules for gotos
M.A. Arbib
,
S. Alagic
Acta Informatica
11
(2), 1979, pp. 139-148
A binary operation on trees and an initial algebra characterization for finite tree types
W. Merzenich
Acta Informatica
11
(2), 1979, pp. 149-168
On the definition of ELR(k) and ELL(k) grammars
S. Heilbrunner
Acta Informatica
11
(2), 1979, pp. 169-176
Constructing LR parsers for regular right part grammars
W.R. Lalonde
Acta Informatica
11
(2), 1979, pp. 177-193
The clean termination of PASCAL programs
D. Coleman
,
J.W. Hughes
Acta Informatica
11
(3), 1979, pp. 195-210
Seiten 1
2
>