1. Systolic automata for VLSI on balanced trees

   • K. Culik II
   • J. Gruska
   • A. Salomaa

   OriginalPaper Pages: 335 - 344

2. Stratified balanced search trees

   • Jan van Leeuwen
   • Mark H. Overmars

   OriginalPaper Pages: 345 - 359

3. Concurrent algorithms for root searching

   • Ole Eriksen
   • Jørgen Staunstrup

   OriginalPaper Pages: 361 - 376

4. The complexity of drawing trees nicely

   • Kenneth J. Supowit
   • Edward M. Reingold

   OriginalPaper Pages: 377 - 392

5. Finite state relational programs

   • Giora Slutzki

   OriginalPaper Pages: 393 - 409

6. On the complexity of some problems concerning the use of procedures. II

   • Karl Winklmann

   OriginalPaper Pages: 411 - 430

7. A network for the detection of words in continuous speech

   • Jean-Pierre Banâtre
   • Patrice Frison
   • Patrice Quinton

   OriginalPaper Pages: 431 - 448

8. Partage de tâches entre processeurs homogenes

   • Philippe Nain

   OriginalPaper Pages: 449 - 466