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=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Performance predictions for extended paged memories
E.G., Jr. Coffman
,
B. Randell
Acta Informatica
1
, 1971/72, pp. 1-13
Optimum binary search trees
D.E. Knuth
Acta Informatica
1
, 1971, pp. 14-25
A model for data structures and its applications. I
W.M. Turski
Acta Informatica
1
, 1971/72, pp. 26-34
The programming language Pascal
N. Wirth
Acta Informatica
1
, 1971, pp. 35-63
Ein Vollständigkeitssatz für Programme und Schaltkreise
V. Claus
Acta Informatica
1
, 1971/72, pp. 64-78
Top-down syntax analysis
Donald E. Knuth
Acta Informatica
1
, 1971/72, pp. 79-110
Application of regular canonical systems to grammars translatable from left to right
H. Langmaack
Acta Informatica
1
, 1971/72, pp. 111-114
Hierarchical ordering of sequential processes
E.W. Dijkstra
Acta Informatica
1
, 1971, pp. 115-138
Schnelle Berechnung von Kettenbruchentwicklungen
A. Schönhage
Acta Informatica
1
, 1971/72, pp. 139-144
Optimal merging of 2 elements with
n
elements
F.K. Hwang
,
S. Lin
Acta Informatica
1
, 1971/72, pp. 145-158
Congruences et automorphismes des automates finis
D. Perrin
,
J.-F. Perrot
Acta Informatica
1
, 1971/72, pp. 159-172
Organization of large ordered indexes
R. Bayer
,
E. McCreight
Acta Informatica
1
, 1972, pp. 173-189
A comparison of two synchronizing concepts
Per Brinch Hansen
Acta Informatica
1
, 1972, pp. 190-199
Optimal scheduling for two processor systems
E.G., Jr. Coffman
,
R.L. Graham
Acta Informatica
1
, 1972, pp. 200-213
Program proving: Jumps and functions
M. Clint
,
C.A.R. Hoare
Acta Informatica
1
, 1971/72, pp. 214-224
Der programmierbare endliche Automat
G. Kaufholz
Acta Informatica
1
, 1971/72, pp. 225-241
Direction controlled programmed grammars
G. Rozenberg
Acta Informatica
1
, 1971/72, pp. 242-252
Inhibitionsfelder
Hermann Walter
Acta Informatica
1
, 1971/72, pp. 253-270
Proof of correctness of data representations
C.A.R. Hoare
Acta Informatica
1
, 1971/72, pp. 271-281
A model for data structures and its applications. (Part II)
W.M. Turski
Acta Informatica
1
, 1971/72, pp. 282-289
Symmetric binary B-trees: Data structure and maintenance algorithms
R. Bayer
Acta Informatica
1
, 1972, pp. 290-306
Least upper bound on the cost of optimum binary search trees
T.C. Hu
,
K.C. Tan
Acta Informatica
1
, 1971/72, pp. 307-310
Bounds on algorithms for string generation
A.C. McKellar
,
C.K. Wong
Acta Informatica
1
, 1971/72, pp. 311-319
Berechnung und Programm. I
V. Strassen
Acta Informatica
1
, 1971/72, pp. 320-335
On non-determinancy in simple computing devices
J. Hartmanis
Acta Informatica
1
, 1971/72, pp. 336-344
Seiten 1
2
>