Reference List of Indexed Articles

More documents

Recommendations

Info

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

342 Reference List / Information Processing Letters 78 (2001) 337–448 190. S. Chrobot, Layer – a language construction for concurrent structural program design 4 (5) (1976) 113– 117 191. R.J. Cunningham and M.E.J. Gilford, A note on the semantic definition of side effects 4 (5) (1976) 118– 120 192. W. Coy, The logical meaning of programs of a subrecursive language 4 (5) (1976) 121–126 193. G. Rozenberg, On slicing of K-iteration grammars 4 (5) (1976) 127–131 194. J.L. Bentley and W.A. Burkhard, Heuristics for partial-match retrieval data base design 4 (5) (1976) 132–135 195. S. De Wolf and G. De Mey, Numerical solution of integral equations for potential problems by a variational principle 4 (5) (1976) 136–139 196. P.A. Pritchard, A proof rule for multiple coroutine systems 4 (6) (1976) 141–143 197. P.J.A. Reusch, Generalized lattices applicable in retrieval models 4 (6) (1976) 144–148 198. D. Dobkin and J. van Leeuwen, The complexity of vector-products 4 (6) (1976) 149–154 199. G. Yuval, An algorithm for finding all shortest paths using N 2.81 infinite-precision multiplications 4 (6) (1976) 155–156 200. J. Engelfriet and S. Skyum, Copying theorems 4 (6) (1976) 157–161 201. G. Rozenberg and D. Wood, A note on K-iteration grammars 4 (6) (1976) 162–164 202. R. Krzemień and A. Łukasiewicz, Automatic generation of lexical analyzers in a compiler–compiler 4 (6) (1976) 165–168 203. B.K. Gairola and V. Rajaraman, A distributed index sequential access method 5 (1) (1976) 1–5 204. G. Manacher, An application of pattern matching to a problem in geometrical complexity 5 (1) (1976) 6–7 205. E. Arjomandi, On finding all unilaterally connected components of a digraph 5 (1) (1976) 8–10 206. H.A. Maurer, Th. Ottmann and H.-W. Six, Implementing dictionaries using binary trees of very small height 5 (1) (1976) 11–14 207. L. Hyafil and R.L. Rivest, Constructing optimal binary decision trees is NP-complete 5 (1) (1976) 15–17 208. A.B. Barak, On the parallel evaluation of division-free arithmetic expressions with fan-in of three 5 (1) (1976) 18–19 209. L.G. Valiant, Relative complexity of checking and evaluating 5 (1) (1976) 20–23 210. P.S.-P. Wang, Recursiveness of monotonic array grammars and a hierarchy of array languages 5 (1) (1976) 24–26 211. G. Marsaglia, K. Ananthanarayanan and N.J. Paul, Improvements on fast methods for generating normal random variables 5 (2) (1976) 27–30 212. M. Sassa and E. Goto, A hashing method for fast set operations 5 (2) (1976) 31–34 213. C.J. Lucena and D.D. Cowan, Toward a system’s environment for computer assisted programming 5 (2) (1976) 35–40 214. N.K. Madsen, G.H. Rodrigue and J.I. Karush, Matrix multiplication by diagonals on a vector/parallel processor 5 (2) (1976) 41–45 215. R.L. Probert, Commutativity, non-commutativity, and bilinearity 5 (2) (1976) 46–49 216. P. Hansen, A cascade algorithm for the logical closure of a set of binary relations 5 (2) (1976) 50–54 217. S. Kundu, A linear algorithm for the hamiltonian completion number of a tree 5 (2) (1976) 55–57 218. D. Mandrioli, n-reconstructability of context-free grammars 5 (2) (1976) 58–62 219. G. Yuval, Finding nearest neighbours 5 (3) (1976) 63–65 220. E.L. Lawler, A note on the complexity of the chromatic number problem 5 (3) (1976) 66–67 221. F. Luccio and F.P. Preparata, Storage for consecutive retrieval 5 (3) (1976) 68–71 222. N. Santoro, Full table search by polynomial functions 5 (3) (1976) 72–74 223. D.A. Zave, A series expansion involving the harmonic numbers 5 (3) (1976) 75–77 224. E.L. Lozinskii, On a problem in storage optimization 5 (3) (1976) 78–80 225. R.K. Shyamasundar, A note on linear precedence functions 5 (3) (1976) 81 226. J.L. Bentley and A.C.-C. Yao, An almost optimal algorithm for unbounded searching 5 (3) (1976) 82–87 227. K.S. Trivedi, On a semaphore anomaly 5 (3) (1976) 88–89 228. P.S.-P. Wang, Recursiveness of monotonic array grammars and a hierarchy of array languages (Erratum) 5 (3) (1976) 90 229. D.R. Innes and S. Tsur, Interval analysis, pagination and program locality 5 (4) (1976) 91–96 230. L. Meertens, A space-saving technique for assigning ALGOL 68 multiple values 5 (4) (1976) 97–99
Reference List / Information Processing Letters 78 (2001) 337–448 343 231. C.T. Yu and D.T. Johnson, On the complexity of finding the set of candidate keys for a given set of functional dependencies 5 (4) (1976) 100–101 232. G. Rozenberg, More on ET0L systems versus random context grammars 5 (4) (1976) 102–106 233. B. Samadi, B-trees in a system with multiple users 5 (4) (1976) 107–112 234. H.N. Gabow, Some improved bounds on the number of 1-factors of n-connected graphs 5 (4) (1976) 113–115 235. G.V. Bochmann, Comments on monitor definition and implementation 5 (4) (1976) 116–117 236. M. Boari and A. Natali, Some properties of deadlock detection and recovery in readers and writers problems 5 (4) (1976) 118–123 237. K. Delcour and A.J.W. Duijvestein, Enclosures: An access control mechanism with applications in parallel programming and other areas of system programming 5 (5) (1976) 125–135 238. M.A. Hennell, M.R. Woodward and D. Hedley, On program analysis 5 (5) (1976) 136–140 239. G. Guida and M. Somalvico, Semantics in problem representation and search 5 (5) (1976) 141–145 240. J. Doyle and R.L. Rivest, Linear expected time of a simple Union-Find algorithm 5 (5) (1976) 146–148 241. M. Linna, The D0L-ness for context-free languages is decidable 5 (5) (1976) 149–151 242. J. Duske, R. Parchmann and H. Schumacher, A pattern representation of indexed languages 5 (5) (1976) 152–154 243. D.P. Friedman and D.S. Wise, Output driven interpretation of recursive programs, or writing creates and destroys data structures 5 (6) (1976) 155–160 244. D.P. Friedman and D.S. Wise, Garbage collecting a heap which includes a scatter table 5 (6) (1976) 161–164 245. H.N. Gabow, A note on degree-constrained star subgraphs of bipartite graphs 5 (6) (1976) 165–167 246. K. Mehlhorn, Bracket-languages are recognizable in logarithmic space 5 (6) (1976) 168–170 247. R. Kaye, A Gray Code for set partitions 5 (6) (1976) 171–173 248. H. Partsch and P. Pepper, A family of rules for recursion removal 5 (6) (1976) 174–177 249. D.E. Knuth, A generalization of Dijkstra’s algorithm 6 (1) (1977) 1–5 250. G. Yuval, Theil’s estimator 6 (1) (1977) 6–7 251. E. Goto, T. Ida and T. Gunji, Parallel hashing algorithms 6 (1) (1977) 8–13 252. N. Deo, M.S. Krishnamoorthy and A.B. Pai, Generalizations of line graphs and applications 6 (1) (1977) 14–17 253. F. Chin and K. Steiglitz, A fast error evaluation algorithm for polynomial approximation 6 (1) (1977) 18–21 254. S.S. Reddi, Alternate solutions to the Cigarette Smokers’ Problem without conditionals 6 (1) (1977) 22–24 255. A. Rowicki, A note on optimal preemptive scheduling for two-processor systems 6 (1) (1977) 25–28 256. T.H. Merrett, Relations as programming language elements 6 (1) (1977) 29–33 257. C.P. Schnorr and H. Klupp, A universally hard set of formulae with respect to non-deterministic Turing acceptors 6 (2) (1977) 35–37 258. A.P. Ershov, On the partial computation principle 6 (2) (1977) 38–41 259. R. Zuczek, The universal space for parallel computation 6 (2) (1977) 42–45 260. A. Endres and H.-G. Stork, FIFO-optimal placement on pages of independently referenced sectors 6 (2) (1977) 46–49 261. M. Sassa and E. Goto, “V-tape”, a virtual memory oriented data type, and its resource requirements 6 (2) (1977) 50–55 262. J.P. Banatre, Producing optimised code for coercions 6 (2) (1977) 56–59 263. M.H. Williams, Complete operator precedence conditions 6 (2) (1977) 60–62 264. V. Rajaraman and O. Vikas, A first-in-first-out buffered cyclic memory 6 (2) (1977) 63–68 265. T. Hikita and E. Goto, An O(N) algorithm for finding periodicity of a sequence using hash coding 6 (2) (1977) 69–71 266. E.A. Dinic, A.K. Kelmans and M.A. Zaitsev, Nonisomorphic trees with the same T -polynomial 6 (3) (1977) 73–76 267. J. Kittler, A method for determining class subspaces 6 (3) (1977) 77–79 268. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space 6 (3) (1977) 80–82 269. A. Jávor, An adaptive time advancement algorithm for discrete simulation 6 (3) (1977) 83–86
Page 1 and 2: Information Processing Letters 78 (
Page 3 and 4: Reference List / Information Proces
Page 5: Reference List / Information Proces
Page 57 and 58:
Reference List / Information Proces
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

Create successful ePaper yourself

Delete template?

Save as template?