Articles

1. Fast algorithms for the elimination of common subexpressions

   • J. D. Ullman

   OriginalPaper Pages: 191 - 213

2. A reply to comments on “A comparison of two synchronizing concepts”

   • Per Brinch Hansen

   OriginalPaper Pages: 189 - 190

3. Sur diverses familles de langages fermées par transduction rationnelle

   • L. Boasson
   • M. Nivat

   OriginalPaper Pages: 180 - 188

4. Minimale und m-minimale Variablenmengen für partielle Boole'sche Funktionen

   • H. -D. Ehrich

   OriginalPaper Pages: 172 - 179

5. Sequential and jumping machines and their relation to computers

   • Karel Čulík
   • Michael A. Arbib

   OriginalPaper Pages: 162 - 171

6. Synchronisationsgraphen

   • H. J. Genrich
   • K. Lautenbach

   OriginalPaper Pages: 143 - 161

7. On correct procedure parameter transmission in higher programming languages

   • Hans Langmaack

   OriginalPaper Pages: 110 - 142

8. Describing an algorithm by Hopcroft

   • David Gries

   OriginalPaper Pages: 97 - 109

9. Lineare Realisierbarkeit endlicher Automaten über endlichen Körpern

   • Lutz Eichner

   OriginalPaper Pages: 75 - 100

10. Normal forms for context-sensitive grammars

    • A. B. Cremers

    OriginalPaper Pages: 59 - 73

11. Rangierkomplexität von permutationen

    • Hanns -Jörg Stoß

    OriginalPaper Pages: 80 - 96

12. Critical comments on the programming language Pascal

    • A. N. Habermann

    OriginalPaper Pages: 47 - 57

13. Berechnung und Programm. II

    • Volker Strassen

    OriginalPaper Pages: 64 - 79

14. Reducing the number of multiplikations in iterative processes

    • B. L. Fox

    OriginalPaper Pages: 43 - 45

15. Program proving: Coroutines

    • M. Clint

    OriginalPaper Pages: 50 - 63

16. Node flows in graphs with conservative flow

    • A. Nahapetian

    OriginalPaper Pages: 37 - 41

17. On sentential forms of context-free grammars

    • Arto Salomaa

    OriginalPaper Pages: 40 - 49

18. Optimal disk merge patterns

    • Maurice Schlumberger
    • Jean Vuillemin

    OriginalPaper Pages: 25 - 35

19. EfficientLR (1) parsers

    • T. Anderson
    • J. Eve
    • J. J. Horning

    OriginalPaper Pages: 12 - 39

20. Job scheduling guaranteing reasonable turn-around times

    • Søren Lauesen

    OriginalPaper Pages: 1 - 11

21. Page size in demand-paging systems

    • E. Gelenbe
    • P. Tiberio
    • J. C. A. Boekhorst

    OriginalPaper Pages: 1 - 23

22. Comments on “A comparison of two synchronizing concepts by P.B. Hansen”

    • P. J. Courtois
    • F. Heymans
    • D. L. Parnas

    OriginalPaper Pages: 375 - 376

23. Automatic analysis of inflectional morphems in German nouns

    • Gerda Schott

    OriginalPaper Pages: 360 - 374

24. Endliche Automaten und Zufallsfolgen

    • C. P. Schnorr
    • H. Stimm

    OriginalPaper Pages: 345 - 359

25. On non-determinancy in simple computing devices

    • Juris Hartmanis

    OriginalPaper Pages: 336 - 344

26. Berechnung und programm. I

    • Volker Strassen

    OriginalPaper Pages: 320 - 335

27. Bounds on algorithms for string generation

    • A. C. McKellar
    • C. K. Wong

    OriginalPaper Pages: 311 - 319

28. Least upper bound on the cost of optimum binary search trees

    • T. C. Hu
    • K. C. Tan

    OriginalPaper Pages: 307 - 310

29. Symmetric binary B-Trees: Data structure and maintenance algorithms

    • Rudolf Bayer

    OriginalPaper Pages: 290 - 306

30. A model for data structures and its applications. (Part II)

    • W. M. Turski

    OriginalPaper Pages: 282 - 289

31. Proof of correctness of data representations

    • C. A. R. Hoare

    OriginalPaper Pages: 271 - 281

32. Optimum binary search trees

    • Donald E. Knuth

    Corrigenda to Pages: 270 - 270

33. Inhibitionsfelder

    • Hermann Walter

    OriginalPaper Pages: 253 - 270

34. Direction controlled programmed grammars

    • G. Rozenberg

    OriginalPaper Pages: 242 - 252

35. Der programmierbare endliche automat

    • G. Kaufhol

    OriginalPaper Pages: 225 - 241

36. Program proving: Jumps and functions

    • M. Clint
    • C. A. R. Hoare

    OriginalPaper Pages: 214 - 224

37. Optimal scheduling for two-processor systems

    • E. G. Coffman Jr.
    • R. L. Graham

    OriginalPaper Pages: 200 - 213

38. A comparison of two synchronizing concepts

    • Brinch Per Hansen

    OriginalPaper Pages: 190 - 199

39. Organization and maintenance of large ordered indexes

    • R. Bayer
    • E. M. McCreight

    OriginalPaper Pages: 173 - 189

40. Congruences et Automorphismes des Automates Finis

    • D. Perrin
    • J. F. Perrot

    OriginalPaper Pages: 159 - 172

41. Optimal merging of 2 elements with n elements

    • F. K. Hwang
    • S. Lin

    OriginalPaper Pages: 145 - 158

42. Schnelle Berechnung von Kettenbruchentwicklungen

    • A. Schönhage

    OriginalPaper Pages: 139 - 144

43. Hierarchical ordering of sequential processes

    • E. W. Dijkstra

    OriginalPaper Pages: 115 - 138

44. Application of regular canonical systems to grammars translatable from left to right

    • H. Langmaack

    OriginalPaper Pages: 111 - 114

45. Top-down syntax analysis

    • Donald E. Knuth

    OriginalPaper Pages: 79 - 110

46. Ein Vollständigkeitssatz für Programme und Schaltkreise

    • V. Claus

    OriginalPaper Pages: 64 - 78

47. The programming language pascal

    • N. Wirth

    OriginalPaper Pages: 35 - 63

48. A model for data structures and its applications. I

    • W. M. Turski

    OriginalPaper Pages: 26 - 34

49. Optimum binary search trees

    • D. E. Knuth

    OriginalPaper Pages: 14 - 25

50. Performance predictions for extended paged memories

    • E. G. Coffman Jr.
    • B. Randell

    OriginalPaper Pages: 1 - 13