1. A principle of independence for binary tree searching

   • Leo J. Guibas

   OriginalPaper Pages: 293 - 298

2. Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme

   • H. -D. Ehrich

   OriginalPaper Pages: 299 - 310

3. A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions

   • Yu. Breitbart
   • A. Reiter

   OriginalPaper Pages: 311 - 319

4. Boolesche Minimalpolynome und Überdeckungsprobleme

   • Wolfgang J. Paul

   OriginalPaper Pages: 321 - 336

5. Deriving graphs from graphs by applying a production

   • Barry K. Rosen

   OriginalPaper Pages: 337 - 357

6. WCS-analysis of the Context-Sensitive

   • P. F. Schuler

   OriginalPaper Pages: 359 - 371

7. EOL systems with control devices

   • M. Nielsen

   OriginalPaper Pages: 373 - 386