Reference List of Indexed Articles

More documents

Recommendations

Info

$res://C:\Program Files\Microsoft ACT\act.exe/RPTSUMMARY.HTM$

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. S. Krogdahl, A dynamic storage allocation problem 2 (4) (1973) 96–99 84. J. Cohen, Syntax-directed unit conversion 2 (4) (1973) 100–102 85. G. Yuval, On a problem connected with topological sorting 2 (4) (1973) 103–104 86. R. Devillers and G. Louchard, Realization of Petri nets without conditional statements 2 (4) (1973) 105– 107 87. N.D. Roussopoulos, A max{m, n} algorithm for determining the graph H from its line graph G 2 (4) (1973) 108–112 88. V.N. Kasyanov, Some properties of fully reducible graphs 2 (4) (1973) 113–117 89. I.N. Molchanov and E.F. Galba, On the convergence of difference schemes approximating a plane static problem of the theory of elasticity with mixed boundary conditions 2 (4) (1973) 118–122 90. R.W. Floyd and A.J. Smith, A linear time two tape merge 2 (5) (1973) 123–125 91. J.K.R. Barnett, A technique for reducing comparison times in certain applications of the merging method of sorting 2 (5) (1973) 127–128 92. H.S. Warren Jr., Minimal comparison sorting by choosing most efficient comparisons 2 (5) (1973) 129– 130 93. J. Karhumäki, An example of a PD2L-system with the growth type 2 1 2 2 (5) (1973) 131–134 94. L. Boasson, The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper 2 (5) (1973) 135–140 95. N. Francez and G. Slutzky, On the non-compactness of the class of program schemas 2 (5) (1973) 141– 142 96. B. Dwyer, Simple algorithms for traversing a tree without an auxiliary stack 2 (5) (1973) 143–145 97. H.T. Kung, A new upper bound on the complexity of derivative evaluation 2 (5) (1973) 146–147 98. H. Heuer and I.N. Molchanov, Numerical solution of a boundary problem for equations of elastic equilibrium of bodies in transferences 2 (5) (1973) 148–151 99. D.E. Knuth and J.L. Szwarcfiter, A structured program to generate all topological sorting arrangements 2 (6) (1974) 153–157 100. N. Solntseff, On a notational device for the description of pointer-free operations on structured data 2 (6) (1974) 158–159 101. R.E. Tarjan, A note on finding the bridges of a graph 2 (6) (1974) 160–161 102. R.B.K. Dewar, A stable minimum storage sorting algorithm 2 (6) (1974) 162–164 103. C.A.R. Hoare, Optimization of store size for garbage collection 2 (6) (1974) 165–166 104. A.G. Middleton, Cost-oriented program optimisation 2 (6) (1974) 167–170 105. A. Hansal, “Software devices” for processing graphs using PL/I compile time facilities 2 (6) (1974) 171– 179
Page 1: Information Processing Letters 78 (
Page 5 and 6: Reference List / Information Proces
Page 53 and 54:
Reference List / Information Proces
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
show all

Reference List of Indexed Articles

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?