Volume 4, 1974

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

last updated on Sat May 25 05:47:11 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page