Reference List of Indexed Articles

340 Reference List / Information Processing Letters 78 (2001) 337–448
106. L.W. Jackson and S. Dasgupta, The identification of parallel micro-operations 2 (6) (1974) 180–184
107. K.P. Lee and G. Rozenberg, The length sets of D0L languages are uniformly bounded 2 (6) (1974) 185–
188
108. J. Minker and G.J. VanderBrug, The Earley algorithm as a problem representation 3 (1) (1974) 1–7
109. K. Noshita, Median selection of 9 elements in 14 comparisons 3 (1) (1974) 8–12
110. R.E. Tarjan, A new algorithm for finding weak components 3 (1) (1974) 13–15
111. L.W. Cooprider, F. Heymans, P.J. Courtois and D.L. Parnas, Information streams sharing a finite buffer:
Other solutions 3 (1) (1974) 16–21
112. J. van Leeuwen and C.H. Smith, An improved bound for detecting looping configurations in deterministic
DPA’s 3 (1) (1974) 22–24
113. O.H. Ibarra, A note on semilinear sets and bounded-reversal multihead pushdown automata 3 (1) (1974)
25–28
114. D.A. Fisher, Bounded workspace garbage collection in an address-order preserving list processing
environment 3 (1) (1974) 29–32
115. A.D. Jovanovich, Note on a modification of the fundamental cycles finding algorithm 3 (1) (1974) 33
116. T. Takaoka, A note on the ambiguity of context-free grammars 3 (2) (1974) 35–36
117. J.A. Campbell, Optimal use of storage in a simple model of garbage collection 3 (2) (1974) 37–38
118. M.V. Zelkowitz, Structured operating system organization 3 (2) (1974) 39–42
119. L.E. Deimel Jr., Remark on the computational power of a Turing machine variant 3 (2) (1974) 43–45
120. S. Arnborg, Abstract computation model used for a production compiler 3 (2) (1974) 46–50
121. R.E. Tarjan, A good algorithm for edge-disjoint branching 3 (2) (1974) 51–53
122. K. Kobayashi, A note on extending equivalence theories of algorithms 3 (2) (1974) 54–56
123. N.S. Sridharan, Computer generation of vertex graphs 3 (2) (1974) 57–63
124. R.J. Lipton and R.W. Tuttle, A synchronization anomaly 3 (3) (1975) 65–66
125. C. Hosono, On the cardinality of some lattices 3 (3) (1975) 67–68
126. S.H. von Solms, On T0L languages over terminals 3 (3) (1975) 69–70
127. S. Dasgupta and J. Tartar, On the minimization of control memories 3 (3) (1975) 71–74
128. T. Kameda, On the vector representation of the reachability in planar directed graphs 3 (3) (1975) 75–77
129. S. Crespi-Reghizzi and D. Mandrioli, A decidability theorem for a class of vector-addition systems 3 (3)
(1975) 78–80
130. P.M. Camerini and F. Maffioli, Bounds for 3-matroid intersection problems 3 (3) (1975) 81–83
131. J.F. Reiser and D.E. Knuth, Evading the drift in floating-point addition 3 (3) (1975) 84–87
132. I. Dal Bono, M. Diligenti, C. Mosca, A. Ricci and A. Villani, A simple FORTRAN support for computerassisted
instruction 3 (3) (1975) 88–90
133. K. Weihrauch, Program schemata with polynomial bounded counters 3 (3) (1975) 91–96
134. S. Galand and G. Loncour, Structured implementation of symbolic execution: A first part in a program
verifier 3 (4) (1975) 97–103
135. J. Cohen, Interpretation of non-deterministic algorithms in higher-level languages 3 (4) (1975) 104–109
136. F. Gavril, An algorithm for testing chordality of graphs 3 (4) (1975) 110–112
137. G. Yuval, Finding near neighbours in K-dimensional space 3 (4) (1975) 113–114
138. I. Cahit and R. Cahit, On the graceful numbering of spanning trees 3 (4) (1975) 115–118
139. B. Wegbreit, Retrieval from context trees 3 (4) (1975) 119–120
140. S. De Wolf and G. De Mey, Numerical methods for solving integral equations of potential problems 3
(4) (1975) 121–124
141. J.M. Robson, A simple solution to the interleaved memory bandwidth problem 3 (4) (1975) 125–126
142. C. Lazos, A comparison of simulation results and a mathematical model of a multiprogramming system
3 (5) (1975) 127–134
143. J. Kittler, On the divergence and the Joshi dependence measure in feature selection 3 (5) (1975) 135–137
144. J. van Leeuwen, The membership question for ET0L-languages is polynomially complete 3 (5) (1975)
138–143
145. F.P. Preparata and D.E. Muller, The time required to evaluate division-free arithmetic expressions 3 (5)
(1975) 144–146
146. H. Asai and S.C. Lee, Design of queuing buffer register size 3 (5) (1975) 147–152
147. A. Stevens, An elementary computer algorithm for the calculation of the coefficient of inbreeding 3 (5)
(1975) 153–163