Acta Informatica, Volume 4

Volume 4, 1974

• Raphael A. Finkel, Jon Louis Bentley: Quad Trees: A Data Structure for Retrieval on Composite Keys. 1-9 BibTeX
• Alexandre Brandwajn: A Model of a Time Sharing Virtual Memory System Solved Using Equivalence and Decomposition Methods. 11-47 BibTeX
• Guy Fayolle, Erol Gelenbe, Jacques Labetoulle, D. Bastin: The Stability Problem of Broadcast Packet Switching Computer Networks. 49-53 BibTeX
• Günter Hotz: Sequentielle Analyse kontextfreier Sprachen. 55-75 BibTeX
• Nabil A. Khabbaz: Multipass Precedence Analysis. 77-85 BibTeX
• Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, Sven Skyum: Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems. 87-106 BibTeX
• Yuri Breitbart, Allen Reiter: Algorithms for Fast Evaluation of Boolean Expressions. 107-116 BibTeX
• Glen E. Newton: Proving Properties of Interacting Processes. 117-126 BibTeX
• Jay M. Spitzen, Ben Wegbreit: The Verification and Synthesis of Data Structures. 127-144 BibTeX
• Shigeru Igarashi, Ralph L. London, David C. Luckham: Automatic Program Verification I: A Logical Basis and its Implementation. 145-182 BibTeX
• Jay Earley: Ambiguity and Precedence in Syntax Description. 183-192 BibTeX
• Oscar H. Ibarra, Chul E. Kim: On 3-Head Versus 2-Head Finite Automata. 193-200 BibTeX
• Hans-Dieter Ehrich: Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil I: Datenstrukturen und Schemata. 201-211 BibTeX
• James F. Gimpel: Nonlinear Pattern Theory. 213-229 BibTeX
• Olivier Lecarme, Pierre Desjardins: More Comments on the Programming Language Pascal. 231-243 BibTeX
• Paul M. Zislis: Semantic Decomposition of Computer Programs: An Aid to Program Testing. 243-269 BibTeX
• J.-P. Lévy: Automatic Correction of Syntax-Errors in Programming Languages. 271-292 BibTeX
• Leonidas J. Guibas: A Principle of Independence for Binary Tree Searching. 293-298 BibTeX
• Hans-Dieter Ehrich: Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil II: Zugriffssysteme. 299-310 BibTeX
• Yuri Breitbart, Allen Reiter: A Branch-and-Bound Algorithm to Obtain an Optimal Evaluation Tree for Monotonic Boolean Functions. 311-319 BibTeX
• Wolfgang J. Paul: Boolesche Minimalpolynome und Überdeckungsprobleme. 321-336 BibTeX
• Barry K. Rosen: Deriving Graphs from Graphs by Applying a Production. 337-357 BibTeX
• P. F. Schuler: WCS-Analysis of the Context-Sensitive. 359-371 BibTeX
• Mogens Nielsen: EOL Systems with Control Devices. 373-386 BibTeX