Information Processing Letters 78 (2001) 337–448 Reference List of Indexed Articles This Reference List of Indexed Articles belongs to the Subject Index Volumes 1–75 (pp. 5–336 of this issue). 1. G.M. Stacey, The role of virtual memory in the handling of application files 1 (1) (1971) 1–3 2. F.G. Duncan and D. Zissos, Programmed simulation of sequential circuits 1 (1) (1971) 4–6 3. H.A. Maurer, The solution of a problem by Ginsburg 1 (1) (1971) 7–10 4. D. Zissos and F.G. Duncan, Programmed simulation of race hazards in sequential circuits 1 (1) (1971) 11–13 5. W. Henhapl and C.B. Jones, A run-time mechanism for referencing variables 1 (1) (1971) 14–16 6. T.H. Merrett, General programs for management systems 1 (1) (1971) 17–20 7. H. Karlgren, Stacking without really stacking when reducing categorical expressions 1 (1) (1971) 21–22 8. D.E. Knuth and R.W. Floyd, Notes on avoiding “go to” statements 1 (1) (1971) 23–31 9. J. Hopcroft and R. Tarjan, A V 2 algorithm for determining isomorphism of planar graphs 1 (1) (1971) 32–34 10. G. Salton, The performance of interactive information retrieval 1 (2) (1971) 35–41 11. D. Tsichritzis, A note on comparison of subrecursive hierarchies 1 (2) (1971) 42–44 12. B.F. Caviness, P.L. Pollack and C.M. Rubald, An existence lemma for canonical forms in symbolic mathematics 1 (2) (1971) 45–46 13. D.L. Milgram and A. Rosenfeld, A note on scattered context grammars 1 (2) (1971) 47–50 14. D.G. Corneil, An n2 algorithm for determining the bridges of a graph 1 (2) (1971) 51–55 15. I. Munro, Efficient determination of the transitive closure of a directed graph 1 (2) (1971) 56–58 16. E. Gelenbe, The two-thirds rule for dynamic storage allocation under equilibrium 1 (2) (1971) 59–60 17. H. Scheidig, Representation and equality of modes 1 (2) (1971) 61–65 18. A. Borodin and I. Munro, Evaluating polynomials at many points 1 (2) (1971) 66–68 19. S.G. Tzafestas, Input–output modeling and identification of linear automata 1 (3) (1972) 69–75 20. J.C. Ogilvie and C.L. Olson, On the use of complete subgraphs in cluster analysis 1 (3) (1972) 76–79 21. A. van Dam and F.Wm. Tompa, Software data paging and segmentation for complex systems 1 (3) (1972) 80–86 22. J.F. Whale, The critical value of the basic parameter of a nonlinear differential equation 1 (3) (1972) 87–90 23. N. Solntseff, A classification of extensible programming languages 1 (3) (1972) 91–96 24. N. Solntseff and A. Yezerski, ECT – An extensible-contractable translator system 1 (3) (1972) 97–99 25. D. Gries, Programming by induction 1 (3) (1972) 100–107 26. R. Zimmer, Soft precedence 1 (3) (1972) 108–110 27. G. Chroust, Expression evaluation with minimum average working storage 1 (3) (1972) 111–114 28. B.H. Mayoh, Recursion and stacks 1 (3) (1972) 115–116 29. C. Bron, Outline of a machine without branch instructions 1 (3) (1972) 117–119 30. R.E. Tarjan, Determining whether a groupoid is a group 1 (3) (1972) 120–124 31. D. Tsichritzis, Protection in operating systems 1 (4) (1972) 127–131 0020-0190/2001 Published by Elsevier Science B.V. PII:S0020-0190(01)00177-6 338 Reference List / Information Processing Letters 78 (2001) 337–448 32. R.L. Graham, An efficient algorithm for determining the convex hull of a finite planar set 1 (4) (1972) 132–133 33. J.M. Carroll, W. Fraser and G. Gill, Automatic content analysis in an on-line environment 1 (4) (1972) 134–140 34. P. Branquart, J.P. Cardinael, J.P. Delescaille and J. Lewi, A context-free syntax of ALGOL 68 1 (4) (1972) 141–148 35. L. Siklóssy, Fast and read-only algorithms for traversing trees without an auxiliary stack 1 (4) (1972) 149–152 36. G.T. Toussaint, Feature evaluation with quadratic mutual information 1 (4) (1972) 153–156 37. E. Horowitz, A fast method for interpolation using preconditioning 1 (4) (1972) 157–163 38. J. Král, A new additive pseudorandom number generator for extremely short word-lengths 1 (4) (1972) 164–167 39. I.N. Molchanov and L.D. Nikolenko, On an approach to integrating boundary problems with a non-unique solution 1 (4) (1972) 168–172 40. D.E. Knuth and E.B. Kaehler, An experiment in optimal sorting 1 (4) (1972) 173–176 41. D.E. Knuth and R.W. Floyd, Notes on avoiding “go to” statements (Erratum) 1 (4) (1972) 177 42. E.W. Dijkstra, Information streams sharing a finite buffer 1 (5) (1972) 179–180 43. H. Vantilborgh and A. van Lamsweerde, On an extension of Dijkstra’s semaphore primitives 1 (5) (1972) 181–186 44. R.C. Varney, Priority processes used for scheduling within a tree structured operating system 1 (5) (1972) 187–190 45. N.V. Findler, Short note on a heuristic search strategy in long-term memory networks 1 (5) (1972) 191– 196 46. R.S. Anderssen, A refinement procedure for pure random search 1 (5) (1972) 197–200 47. G. Rozenberg, The equivalence problem for deterministic T0L-systems is undecidable 1 (5) (1972) 201– 204 48. I.N. Molchanov and N.I. Stepanets, Iterative methods for solving difference equations of the theory of elasticity not depending on the spacing of the difference net 1 (5) (1972) 205–210 49. G.B. Krepyshev and Ya.A. Pollack, Synthesis of a discrete-time optimal filter algorithm with reduced sensitivity to deviations of a priori statistics 1 (5) (1972) 211–215 50. J. Král, A new pseudorandom number generator for extremely short word-lengths (Erratum) 1 (5) (1972) 216 51. E. Horowitz, A fast method for interpolation with preconditioning (Erratum) 1 (5) (1972) 216 52. A. Brandstetter, Storage requirements in stochastic data acquisition systems 1 (6) (1972) 217–219 53. J. Nievergelt, J. Pradels, C.K. Wong and P.C. Yue, Bounds on the weighted path length of binary trees 1 (6) (1972) 220–225 54. R. Bayer, Oriented balanced trees and equivalence relations 1 (6) (1972) 226–228 55. J. Engelfriet, A note on infinite trees 1 (6) (1972) 229–232 56. G. Rozenberg, Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for 0L systems 1 (6) (1972) 233–235 57. S.G. Tzafestas, Design parameters for a multiserver computer processing buffering system with feedback 1 (6) (1972) 236–243 58. J.L. Baker, An unintentional omission from ALGOL 68 1 (6) (1972) 244–245 59. R. Reddy, W. Broadley, L. Erman, R. Johnsson, J. Newcomer, G. Robertson and J. Wright, XCRIBL – A hardcopy scan line graphics system for document generation 1 (6) (1972) 246–251 60. N. Minsky, Representation of binary trees on associative memories 2 (1) (1973) 1–5 61. G. Salton, Experiments in multi-lingual information retrieval 2 (1) (1973) 6–11 62. J.M. Robson, An improved algorithm for traversing binary trees without auxiliary stack 2 (1) (1973) 12–14 63. E.G. Coffman Jr. and C.J.M. Turnbull, A note on the relative performance of two disk scanning policies 2 (1) (1973) 15–17 64. R.A. Jarvis, On the identification of the convex hull of a finite set of points in the plane 2 (1) (1973) 18–21 65. J. Král and J. Demner, A note on the number of states of the De Remer’s recognizer 2 (1) (1973) 22–23 66. G. Várhegyi, Numerical differentiation of experimental data 2 (1) (1973) 24–25 Reference List / Information Processing Letters 78 (2001) 337–448 339 67. W. Henhapl, A transformation of marked graphs 2 (1) (1973) 26–29 68. A.B. Cremers, H.A. Maurer and O. Mayer, A note on leftmost restricted random context grammars 2 (2) (1973) 31–33 69. S.I. Roschke and A.L. Furtado, An algorithm for obtaining the chromatic number and an optimal coloring of a graph 2 (2) (1973) 34–38 70. J. Coffy, On computing the time complexity of transitive closure algorithms 2 (2) (1973) 39–42 71. A. Rosenfeld and D.L. Milgram, Parallel/sequential array automata 2 (2) (1973) 43–46 72. G. Lindstrom, Scanning list structures without stacks or tag bits 2 (2) (1973) 47–51 73. E.N. Adams III, Another representation of binary tree traversal 2 (2) (1973) 52–54 74. D. Holnapy, M. Szöts and A. Botár, A generalization of the method of finite differences 2 (2) (1973) 55–59 75. G.T. Herman, On universal computer-constructors 2 (3) (1973) 61–64 76. D.T. Tang and C.K. Wong, A modified branch-and-bound strategy 2 (3) (1973) 65–69 77. A. Ehrenfeucht and G. Rozenberg, A limit theorem for sets of subwords in deterministic T0L languages 2 (3) (1973) 70–73 78. M. Mizumoto, J. Toyoda and K. Tanaka, Examples of formal grammars with weights 2 (3) (1973) 74–78 79. T.B. Boffey, Applying the minimax rule over graphs which are not trees 2 (3) (1973) 79–81 80. C.A.R. Hoare, A general conservation law for queueing disciplines 2 (3) (1973) 82–85 81. I.N. Molchanov and M.F. Iakovlev, On one class of iterative methods for obtaining the generalized solution of non-consistent systems of linear algebraic equations 2 (3) (1973) 86–90 82. R. Sethi, A note on implementing parallel assignment instructions 2 (4) (1973) 91–95 83.