Reference List of Indexed Articles

More documents

Recommendations

Info

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

346 Reference List / Information Processing Letters 78 (2001) 337–448 350. M.R. Garey, D.S. Johnson, F.P. Preparata and R.E. Tarjan, Triangulating a simple polygon 7 (4) (1978) 175–179 351. G. Schachtel, A noncommutative algorithm for multiplying 5 × 5 matrices using 103 multiplications 7 (4) (1978) 180–182 352. G. Bongiovanni and F. Luccio, On Cahit’s result on graceful permutations 7 (4) (1978) 183–184 353. R.J. Lipton and R.E. Miller, A batching method for coloring planar graphs 7 (4) (1978) 185–188 354. D.T. Lee and F.P. Preparata, The all nearest-neighbor problem for convex polygons 7 (4) (1978) 189–192 355. R.A. Demillo and R.J. Lipton, A probabilistic remark on algebraic program testing 7 (4) (1978) 193–195 356. J. Jaffe, Counting productions in context-free derivations 7 (4) (1978) 196–200 357. C.E. Hughes, The equivalence of vector addition systems to a subclass of post canonical systems 7 (4) (1978) 201–204 358. W. Burton, Comments on: Sorting by distributive partitioning 7 (4) (1978) 205 359. W. Dobosiewicz, Author’s reply to Warren Burton’s comments on distributive partitioning sorting 7 (4) (1978) 206 360. M. Boari and A. Natali, Multiple access to a tree in the context of readers and writers problem (Erratum) 7 (4) (1978) 207 361. K. Ruohonen, A note on language equations involving morphisms 7 (5) (1978) 209–212 362. I.H. Sudborough, A note on weak operator precedence grammars 7 (5) (1978) 213–218 363. S.G. Akl and G.T. Toussaint, A fast convex hull algorithm 7 (5) (1978) 219–222 364. I. Bratko, Proving correctness of strategies in the AL1 assertional language 7 (5) (1978) 223–230 365. M.R. Brown, A storage scheme for height-balanced trees 7 (5) (1978) 231–232 366. R.K. Arora and R.K. Subramanian, Exploiting the optimal paging algorithms 7 (5) (1978) 233–236 367. K. Noshita, E. Masuda and H. Machida, On the expected behaviors of the Dijkstra’s shortest path algorithm for complete graphs 7 (5) (1978) 237–243 368. L. Czaja, Implementation approach to parallel systems 7 (5) (1978) 244–249 369. T.H. Merrett, QT logic: Simpler and more expressive than predicate calculus 7 (6) (1978) 251–255 370. V.M. Glushkov, G.E. Tseytlin and E.L. Yushchenko, Certain problems of the theory of structured programs schemes 7 (6) (1978) 256–260 371. K.S. Natarajan and L.J. White, Optimum domination in weighted trees 7 (6) (1978) 261–265 372. J. Demetrovics, On the number of candidate keys 7 (6) (1978) 266–269 373. M. Ajtai, J. Komlós and E. Szemerédi, There is no fast single hashing algorithm 7 (6) (1978) 270–273 374. M.R. Garey and R.E. Tarjan, A linear-time algorithm for finding all feedback vertices 7 (6) (1978) 274– 276 375. V.M. Malhotra, M.P. Kumar and S.N. Maheshwari, An O(|V | 3 ) algorithm for finding maximum flows in networks 7 (6) (1978) 277–278 376. R. Giegerich and R. Wilhelm, Counter-one-pass features in one-pass compilation: A formalization using attribute grammars 7 (6) (1978) 279–284 377. G. Yuval, A simple proof of Strassen’s result 7 (6) (1978) 285–286 378. E.P. Friedman and S.A. Greibach, On equivalence and subclass containment problems for deterministic context-free languages 7 (6) (1978) 287–290 379. L. Czaja, Parallel implementation of path expressions 7 (6) (1978) 291–295 380. A. Bykat, Convex hull of a finite set of points in two dimensions 7 (6) (1978) 296–298 381. J. Shortt, An interative program to calculate Fibonacci numbers in O(log n) arithmetic operations 7 (6) (1978) 299–303 382. M. Jakobsson, Huffman coding in bit-vector compression 7 (6) (1978) 304–307 383. J. Teuhola, A compression method for clustered bit-vectors 7 (6) (1978) 308–311 384. D.W. Clark and C.C. Green, A note on shared list structure in LISP 7 (6) (1978) 312–314 385. C.H. Papadimitriou, Efficient search for rationals 8 (1) (1979) 1–4 386. K. Culik II, Some decidability results about regular and pushdown translations 8 (1) (1979) 5–8 387. A.S. Fraenkel, Paired sequential lists in a memory interval 8 (1) (1979) 9–10 388. S.L. Osborn, Testing for existence of a covering Boyce–Codd normal form 8 (1) (1979) 11–14 389. K. Inoue and I. Takanami, A note on cyclic closure operations 8 (1) (1979) 15–16 390. D. Angluin, A note on a construction of Margulis 8 (1) (1979) 17–19 391. S. Fortune and J. Hopcroft, A note on Rabin’s nearest-neighbor algorithm 8 (1) (1979) 20–23 392. Y. Shiloach, Edge-disjoint branching in directed multigraphs 8 (1) (1978) 24–27
Reference List / Information Processing Letters 78 (2001) 337–448 347 393. A. Shamir, Factoring numbers in O(log n) arithmetic steps 8 (1) (1979) 28–31 394. M. Jantzen, A note on vector grammars 8 (1) (1979) 32–33 395. K. Inoue and I. Takanami, A nnote on bottom-up pyramid acceptors 8 (1) (1979) 34–37 396. A. Buda, Generalized 1.5 sequential machine maps 8 (1) (1979) 38–40 397. D.P. Friedman and D.S. Wise, Reference counting can manage the circular environments of mutual recursion 8 (1) (1979) 41–45 398. O.M. Makarov, Using duality to compute the pair of matrix products QY and Y T Q over a commutative ring 8 (1) (1979) 46–49 399. A. Bertoni, G. Mauri and M. Torelli, Three efficient algorithms for counting problems 8 (1) (1979) 50–53 400. G.H. Gonnet, Notes on the derivation of asymptotic expressions from summations (Erratum) 8 (1) (1979) 54 401. G. Lyon, Batch scheduling from short lists 8 (2) (1979) 57–59 402. J. Błażewicz, Deadline scheduling of tasks with ready times and resource constraints 8 (2) (1979) 60–63 403. D.A. Simovici and Gh. Grigoras, Even initial feedback vertex set problems is NP-complete 8 (2) (1979) 64–66 404. J.L.W. Kessels and A.J. Martin, Two implementations of the conditional critical region using a split binary semaphore 8 (2) (1979) 67–71 405. M. van der Nat, Binary merging by partitioning 8 (2) (1979) 72–75 406. J.M. Morris, A starvation-free solution to the mutual exclusion problem 8 (2) (1979) 76–80 407. J. Misra, Space-time trade off in implementing certain set operations 8 (2) (1979) 81–85 408. H.W. Lenstra Jr., Miller’s primality test 8 (2) (1979) 86–88 409. S.P. Reiss, Rational search 8 (2) (1979) 89–90 410. H.S.M. Kruijer, Self-stabilization (in spite of distributed control) in tree-structured systems 8 (2) (1979) 91–95 411. D. Dobkin, R.J. Lipton and S. Reiss, Linear programming is log-space hard for P 8 (2) (1979) 96–97 412. T.H. Pequeno and C.J. Lucena, An approach for data type specification and its use in program verification 8 (2) (1979) 98–103 413. G. Pǎun, On Szilard’s languages associated to a matrix grammar 8 (2) (1979) 104–105 414. J.C. Cherniavsky, On finding test data sets for loop free programs 8 (2) (1979) 106–107 415. S.G. Akl, Two remarks on a convex hull algorithm 8 (2) (1979) 108–109 416. Yu.G. Stoyan and V.Z. Socolovsky, The minimization method for some permutation functionals 8 (2) (1979) 110–111 417. C.C. Rick and D.J. Evans, An improved bisection algorithm 8 (2) (1979) 112–113 418. W. Cellary, A new safety test for deadlock avoidance 8 (3) (1979) 115–120 419. B. Aspvall, M.F. Plass and R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas 8 (3) (1979) 121–123 420. O. Vikas, Analysis of a periodically inspected buffer 8 (3) (1979) 124–130 421. R. Mathon, A note on the graph isomorphism counting problem 8 (3) (1979) 131–132 422. J.L. Bentley and H.A. Maurer, A note of Euclidean near neighbor searching in the plane 8 (3) (1979) 133–136 423. G.J.M. Sang Ajang and F. Teer, An efficient algorithm for detection of combined occurrences 8 (3) (1979) 137–140 424. S. Kundu, An intermediate-value theorem for optimum tree valuation 8 (3) (1979) 141–145 425. Y. Shiloach, Strong linear orderings of a directed network 8 (3) (1979) 146–148 426. J. van Leeuwen, On compromising statistical data-bases with a few known elements 8 (3) (1979) 149– 153 427. M.R. Brown, Addendum to “A storage scheme for height-balanced trees” 8 (3) (1979) 154–156 428. S.G. Akl and G.T. Toussaint, Addendum to “An improved algorithm to check for polygon similarity” 8 (3) (1979) 157–158 429. M.A. Bonuccelli and D.P. Bovet, Minimum node disjoint path covering for circular-arc graphs 8 (4) (1979) 159–161 430. L. Czaja, A specification of parallel problems 8 (4) (1979) 162–167 431. M. Huits and V. Kumar, The practical significance of Distributive Partitioning Sort 8 (4) (1979) 168–169 432. W. Dobosiewicz, The practical significance of D.P. Sort revisited 8 (4) (1979) 170–172 433. A. Fournier, Comments on “Convex hull of a finite set of points in two dimensions” 8 (4) (1979) 173
Page 1 and 2: Information Processing Letters 78 (
Page 3 and 4: Reference List / Information Proces
Page 9: Reference List / Information Proces
Page 61 and 62:
Reference List / Information Proces
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?