default search action
Acta Informatica, Volume 3
Volume 3, 1973
- Erol Gelenbe, Paolo Tiberio, J. C. A. Boekhorst:
Page Size in Demand-Paging Systems. 1-23 - Maurice Schlumberger, Jean Vuillemin:
Optimal Disk Merge Patterns. 25-35 - A. Nahapetian:
Node Flows in Graphs with Conservative Flow. 37-41 - Bennett L. Fox:
Reducing the Number of Multiplikations in Iterative Processes. 43-45 - A. Nico Habermann:
Critical Comments on the Programming Language Pascal. 47-57 - Armin B. Cremers:
Normal Forms for Context-Sensitive Grammars. 59-73 - Lutz Eichner:
Lineare Realisierbarkeit endlicher Automaten über endlichen Körpern. 75-100
Volume 3, 1974
- T. Betteridge:
An Analytic Storage Allocation Model. 101-122 - Ellis Horowitz:
A Unified View of the Complexity of Evaluation and Interpolation. 123-133 - C. A. R. Hoare, Peter E. Lauer:
Consistent and Complementary Formal Theories of the Semantics of Programming Languages. 135-153 - P. F. Schuler:
Weakly Context-Sensitive Languages as Model for Programming Languages. 155-170 - Gerd Kaufholz:
Über die Vernetzungsstruktur von Maschinen. 171-186 - David B. Benson:
An Abstract Machine Theory for Formal Language Parsers. 187-202 - David J. Kuck, Yoichi Muraoka:
Bounds on the Parallel Evaluation of Arithmetic Expressions Using Associativity and Commutativity. 203-216 - Wolfgang J. Paul, Hans-Jörg Stoß:
Zur Komplexität von Sortierproblemen. 217-225 - Hans Langmaack:
On Procedures as Open Subroutines. II. 227-241 - Zohar Manna, Amir Pnueli:
Axiomatic Approach to Total Correctness of Programs. 243-263 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Nonterminals Versus Homomorphisms in Defining Languages for Some Classes of Rewriting Systems. 265-283 - Martti Penttonen:
On Derivation Languages Corresponding to Context-Free Grammars. 285-291 - Jean Berstel:
Sur une Conjecture de S. Greibach. 293-295 - C. C. Gotlieb, Frank Wm. Tompa:
Choosing a Storage Schema. 297-319 - Erol Gelenbe, Jacques Lenfant, Dominique Potier:
Analyse d'un algorithme de gestion simultanée Mémoire centrale - Disque de pagination. 321-345 - M. R. Garey, Ronald L. Graham:
Performance Bounds on the Splitting Algorithm for Binary Testing. 347-355 - Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems. 357-364 - Klaus Ecker, Helmut Ratschek:
Eigenschaften der von linearen Automaten erkennbaren Worte. 365-383 - Lutz Eichner:
Total lineare Realisierbarkeit endlicher Automaten. 385-397
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.