Acta Informatica, Volume 1

Volume 1, 1971

• Edward G. Coffman Jr., Brian Randell:
  Performance Predictions for Extended Paged Memories. 1-13
  
• Donald E. Knuth:
  Optimum Binary Search Trees. 14-25
  
• Wladyslaw M. Turski:
  A Model for Data Structures and Its Applications. I. 26-34
  
• Niklaus Wirth:
  The Programming Language Pascal. 35-63
  
• Volker Claus:
  Ein Vollständigkeitssatz für Programme und Schaltkreise. 64-78
  
• Donald E. Knuth:
  Top-Down Syntax Analysis. 79-110
  
• Hans Langmaack:
  Application of Regular Canonical Systems to Grammars Translatable from Left to Right. 111-114
  
• Edsger W. Dijkstra:
  Hierarchical Ordering of Sequential Processes. 115-138
  
• A. A. Schönhage:
  Schnelle Berechnung von Kettenbruchentwicklungen. 139-144
  
• Frank K. Hwang, Shen Lin:
  Optimal Merging of 2 Elements with n Elements. 145-158
  
• Dominique Perrin, Jean-François Perrot:
  Congruences et Automorphismes des Automates Finis. 159-172
  

Volume 1, 1972

• Rudolf Bayer, Edward M. McCreight:
  Organization and Maintenance of Large Ordered Indices. 173-189
  
• Per Brinch Hansen:
  A Comparison of Two Synchronizing Concepts. 190-199
  
• Edward G. Coffman Jr., Ronald L. Graham:
  Optimal Scheduling for Two-Processor Systems. 200-213
  
• Maurice Clint, C. A. R. Hoare:
  Program Proving: Jumps and Functions. 214-224
  
• Gerd Kaufholz:
  Der programmierbare endliche Automat. 225-241
  
• Grzegorz Rozenberg:
  Direction Controlled Programmed Grammars. 242-252
  
• Hermann K.-G. Walter:
  Inhibitionsfelder. 253-269
  
• C. A. R. Hoare:
  Proof of Correctness of Data Representations. 271-281
  
• Wladyslaw M. Turski:
  A Model for Data Structures and its Applications. (Part II). 282-289
  
• Rudolf Bayer:
  Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms. 290-306
  
• T. C. Hu, K. C. Tan:
  Least Upper Bound on the Cost of Optimum Binary Search Trees. 307-310
  
• A. C. McKellar, C. K. Wong:
  Bounds on Algorithms for String Generation. 311-319
  
• Volker Strassen:
  Berechnung und Programm. I. 320-335
  
• Juris Hartmanis:
  On Non-Determinancy in Simple Computing Devices. 336-344
  
• Claus-Peter Schnorr, H. Stimm:
  Endliche Automaten und Zufallsfolgen. 345-359
  
• Gerda Schott:
  Automatic Analysis of Inflectional Morphems in German Nouns. 360-374
  
• Pierre-Jacques Courtois, F. Heymans, David Lorge Parnas:
  Comments on "A Comparison of Two Synchronizing Concepts by Per Brinch Hansen". 375-376
  

Last update Fri May 25 08:51:37 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page