Reference List of Indexed Articles

More documents

Recommendations

Info

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

368 Reference List / Information Processing Letters 78 (2001) 337–448 1228. D. Richards, Data compression and Gray-code sorting 22 (4) (1986) 201–205 1229. K.-S. Choi and G.C. Kim, A controlled quantification in parsing of Montague grammar 22 (4) (1986) 207–216 1230. P.T. Highnam, Optimal algorithms for finding the symmetries of a planar point set 22 (5) (1986) 219–222 1231. S. Pawagi and I.V. Ramakrishnan, An O(log n) algorithm for parallel update of minimum spanning trees 22 (5) (1986) 223–229 1232. M. Li and Y. Yesha, String-matching cannot be done by a two-head one-way deterministic finite automaton 22 (5) (1986) 231–235 1233. J.B. Evans, Experiments with trees for the storage and retrieval of future events 22 (5) (1986) 237–242 1234. G.K. Gupta and B. Srinivasan, Approximate storage utilization of B-trees 22 (5) (1986) 243–246 1235. P. Bourret and R. Souza de Oliveira, Lower and upper bounds of the sizes of domains: Estimates and experiments 22 (5) (1986) 247–253 1236. H.J. Bernstein, Determining the shape of a convex n-sided polygon by using 2n + k tactile probes 22 (5) (1986) 255–260 1237. A.M. Keller, Set-theoretic problems of null completion in relational databases 22 (5) (1986) 261–266 1238. Y. Manolopoulos, Batched search of index sequential files 22 (5) (1986) 267–272 1239. T.O. Alanko and R.L. Smelianski, On the calculation of control transition probabilities in a program 22 (5) (1986) 273–276 1240. T. Lickteig, Gaussian elimination is optimal for solving linear equations in dimension two 22 (6) (1986) 277–279 1241. Y. Hanatani and R. Fagin, A simple characterization of database dependency implication 22 (6) (1986) 281–283 1242. I. Parberry, On recurrent and recursive interconnection patterns 22 (6) (1986) 285–289 1243. D. Gusfield and L. Pitt, Equivalent approximation algorithms for node cover 22 (6) (1986) 291–294 1244. K. Aizawa and A. Nakamura, Direction-independent application of productions on two-dimensional arrays 22 (6) (1986) 295–301 1245. F. Dehne, O(n 1/2 ) algorithms for the maximal elements and ECDF searching problem on a meshconnected parallel computer 22 (6) (1986) 303–306 1246. K.R. Apt and D.C. Kozen, Limits for automatic verification of finite-state concurrent systems 22 (6) (1986) 307–309 1247. R.K. Arora, S.P. Rana and M.N. Gupta, Distributed termination detection algorithm for distributed computations 22 (6) (1986) 311–314 1248. S. Sattolo, An algorithm to generate a random cyclic permutation 22 (6) (1986) 315–317 1249. E.L. Leiss and C. Jitmedha, Horizontally and vertically bounded propagation of privileges 22 (6) (1986) 319–327 1250. T. Takaoka, An on-line pattern matching algorithm 22 (6) (1986) 329–330 1251. W. Rytter, The space complexity of the unique decipherability problem 23 (1) (1986) 1–3 1252. F.-C. Lin and W.-K. Shih, Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs 23 (1) (1986) 5–9 1253. G. Tinhofer and H. Schreck, The bounded subset sum problem is almost everywhere randomly decidable in O(n) 23 (1) (1986) 11–17 1254. H. Schmeck, On the maximum edge length in VLSI layouts of complete binary trees 23 (1) (1986) 19–23 1255. J.L. Balcázar, On P 2 - immunity 23 (1) (1986) 25–28 1256. K. Culik II and J. Karhumäki, A note on the equivalence problem of rational formal power series 23 (1) (1986) 29–31 1257. K. Kakuta, H. Nakamura and S. Iida, A parallel reference counting algorithm 23 (1) (1986) 33–37 1258. B.-J. Falkowski and L. Schmitz, A note on the queens’ problem 23 (1) (1986) 39–46 1259. O.M. Vikas and S.K. Basandra, Data algebra and its application in database design 23 (1) (1986) 47–54 1260. I. Lavallee and G. Roucairol, A fully distributed (minimal) spanning tree algorithm 23 (2) (1986) 55–62 1261. A. Apostolico, Improving the worst-case performance of the Hunt–Szymanski strategy for the longest common subsequence of two strings 23 (2) (1986) 63–69 1262. H. Rohnert, Shortest paths in the plane with convex polygonal obstacles 23 (2) (1986) 71–76 1263. R.R. Hoogerwoord, An implementation of mutual inclusion 23 (2) (1986) 77–80 1264. W. Rytter, An application of Mehlhorn’s algorithm for bracket languages to log(n) space recognition of input-driven languages 23 (2) (1986) 81–84
Reference List / Information Processing Letters 78 (2001) 337–448 369 1265. J. Laski, An algorithm for the derivation of codefinitions in computer programs 23 (2) (1986) 85–90 1266. J.K. Annot, M.D. Janssens and A.J. van de Goor, Comments on Morris’s starvation-free solution to the mutual exclusion problem 23 (2) (1986) 91–97 1267. S. Ntafos, On gallery watchmen in grids 23 (2) (1986) 99–102 1268. J. Franco, On the probabilistic performance of algorithms for the satisfiability problem 23 (2) (1986) 103–106 1269. B. Codenotti and G. Lotti, Area-time tradeoffs for bilinear forms computations in VLSI 23 (2) (1986) 107–109 1270. B. Codenotti and G. Lotti, A VLSI fast solver for tridiagonal linear systems 23 (3) (1986) 111–114 1271. O.M. Makarov, A noncommutative algorithm for multiplying 5 × 5 matrices using 102 multiplications 23 (3) (1986) 115–117 1272. T.-H. Lai and A. Sprague, A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions 23 (3) (1986) 119–122 1273. J. Cooper and S.G. Akl, Efficient selection on a binary tree 23 (3) (1986) 123–126 1274. P.V. Poblete, Approximating functions by their Poisson transform 23 (3) (1986) 127–130 1275. A.A. Bertossi, Total domination in interval graphs 23 (3) (1986) 131–134 1276. W. Szpankowski, On an asymptotic analysis of a tree-type algorithm for broadcast communications 23 (3) (1986) 135–142 1277. K.W. Wagner, On the intersection of the class of linear context-free languages and the class of single-reset languages 23 (3) (1986) 143–146 1278. G. Mints and E. Tyugu, Semantics of a declarative language 23 (3) (1986) 147–151 1279. K. Taghva, Some characterizations of finitely specifiable implicational dependency families 23 (3) (1986) 153–158 1280. J.T. Udding, Absence of individual starvation using weak semaphores 23 (3) (1986) 159–162 1281. R.B. Tan, G. Tel and J. van Leeuwen, Comments on “Distributed termination detection algorithm for distributed computations” (Letter to the Editor) 23 (3) (1986) 163 1282. H. Schmeck, On the maximum edge length in VLSI layouts of complete binary trees (Corrigendum) 23 (3) (1986) 165 1283. P. Dehornoy, Turing complexity on the ordinals 23 (4) (1986) 167–170 1284. M. Latteux and E. Timmerman, Finitely generated ω-languages 23 (4) (1986) 171–175 1285. B. Alpern, A.J. Demers and F.B. Schneider, Safety without stuttering 23 (4) (1986) 177–180 1286. D.R. O’Hallaron and P.F. Reynolds Jr., A generalized deadlock predicate 23 (4) (1986) 181–188 1287. L. Blum, Towards an asymptotic analysis of Karmarkar’s algorithm 23 (4) (1986) 189–194 1288. A.A. Bertossi and M.A. Bonuccelli, Hamiltonian circuits in interval graph generalizations 23 (4) (1986) 195–200 1289. S. Yamasaki and S. Doshita, Resolution deduction to detect satisfiability for another class including non- Horn sentences in propositional logic 23 (4) (1986) 201–207 1290. D. Gordon, Eliminating the flag in threaded binary search trees 23 (4) (1986) 209–214 1291. O.J. Murphy and S.M. Selkow, The efficiency of using k-d trees for finding nearest neighbors in discrete space 23 (4) (1986) 215–218 1292. R.E. Tarjan, Sensitivity analysis of minimum spanning trees and shortest path trees (Corrigendum) 23 (4) (1986) 219 1293. R. Sommerhalder and S.C. van Westrhenen, A parallel O(log n) algorithm for the drawing of algebraic curves in an n × n square 23 (5) (1986) 221–226 1294. K. Ambos-Spies, A note on complete problems for complexity classes 23 (5) (1986) 227–230 1295. J.L.A. van de Snepscheut and J.T. Udding, An alternative implementation of communication primitives 23 (5) (1986) 231–238 1296. D.J. Evans and N.Y. Yousif, Merging by the parallel jump searching algorithm 23 (5) (1986) 239–246 1297. G. Chen and M.H. Williams, The value of an array facility in Prolog 23 (5) (1986) 247–251 1298. M. Broy, Denotational semantics of communicating sequential programs 23 (5) (1986) 253–259 1299. J. Stojanovski, A note on implementing Prolog in Lisp 23 (5) (1986) 261–264 1300. C.C. Handley, An in situ distributive sort 23 (5) (1986) 265–270 1301. E. Mäkinen, A note on pure grammars 23 (5) (1986) 271–274 1302. E.L. Leiss, The inaccessible set: A classification by query type of security risks in statistical databases 23 (6) (1986) 275–279
Page 1 and 2: Information Processing Letters 78 (
Page 3 and 4: Reference List / Information Proces
Page 31: Reference List / Information Proces
Page 83 and 84:
Reference List / Information Proces
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?