Reference List of Indexed Articles

More documents

Recommendations

Info

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

372 Reference List / Information Processing Letters 78 (2001) 337–448 1380. H. Samet, C.A. Shaffer and R.E. Webber, Digitizing the plane with cells of nonuniform size 24 (6) (1987) 369–375 1381. A. Blumer, A. Ehrenfeucht, D. Haussler and M.K. Warmuth, Occam’s Razor 24 (6) (1987) 377–380 1382. M. Bajantri and D.B. Skillicorn, A fast multiprocessor message passing implementation 24 (6) (1987) 381–389 1383. C.W. Fraser and D.R. Hanson, Optimization of argument evaluation order 24 (6) (1987) 391–395 1384. R. Marie and K.S. Trivedi, A note on the effect of preemptive policies on the stability of a priority queue 24 (6) (1987) 397–401 1385. W.E. Wright, A note on external sorting using almost single input buffering 24 (6) (1987) 403–405 1386. M.K. Sridhar, A new algorithm for parallel solution of linear equations 24 (6) (1987) 407–412 1387. H. Edelsbrunner and M.H. Overmars, Zooming by repeated range detection 24 (6) (1987) 413–417 1388. J.H. Chang, O.H. Ibarra, B. Ravikumar and L. Berman, Some observations concerning alternating Turing machines using small space 25 (1) (1987) 1–9 1389. A.A. Melkman, On-line construction of the convex hull of a simple polyline 25 (1) (1987) 11–12 1390. B. Kirsig and K.-J. Lange, Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n) ≠ NSPACE(log n) 25 (1) (1987) 13–15 1391. R.G. Hamlet, Probable correctness theory 25 (1) (1987) 17–25 1392. R.R. Howell, L.E. Rosier and H.-C. Yen, An O(n 1.5 ) algorithm to decide boundedness for conflict-free vector replacement systems 25 (1) (1987) 27–33 1393. G. Cybenko, D.W. Krumme and K.N. Venkataraman, Fixed hypercube embedding 25 (1) (1987) 35–39 1394. J.-P. Laumond, Obstacle growing in a nonpolygonal world 25 (1) (1987) 41–50 1395. J. Naor, A fast parallel coloring of planar graphs with five colors 25 (1) (1987) 51–53 1396. C.A. Wang and Y.H. Tsin, An O(log n) time parallel algorithm for triangulating a set of points in the plane 25 (1) (1987) 55–60 1397. G.A. Hyslop and E.A. Lamagna, Performance of distributive partitioned sort in a demand paging environment 25 (1) (1987) 61–64 1398. J.H. Reif, A topological approach to dynamic graph connectivity 25 (1) (1987) 65–70 1399. C.A.R. Hoare, J. He and J.W. Sanders, Prespecification in data refinement 25 (2) (1987) 71–76 1400. J. Katajainen, O. Nevalainen and J. Teuhola, A linear expected-time algorithm for computing planar relative neighbourhood graphs 25 (2) (1987) 77–86 1401. M. Atallah and C. Bajaj, Efficient algorithms for common transversals 25 (2) (1987) 87–91 1402. M. Broy, Predicative specifications for functional programs describing communicating networks 25 (2) (1987) 93–101 1403. K.B. Lakshmanan, N. Meenakshi and K. Thulasiraman, A time-optimal message-efficient distributed algorithm for depth-first-search 25 (2) (1987) 103–109 1404. A.M. Frieze, Parallel algorithms for finding hamilton cycles in random graphs 25 (2) (1987) 111–117 1405. F.M. Maley, An observation concerning constraint-based compaction 25 (2) (1987) 119–122 1406. V.J. Rayward-Smith, The complexity of preemptive scheduling given interprocessor communication delays 25 (2) (1987) 123–125 1407. R.B. Boppana, J. Hastad and S. Zachos, Does co-NP have short interactive proofs? 25 (2) (1987) 127–132 1408. R.D. Tennent, Quantification in Algol-like languages 25 (2) (1987) 133–137 1409. G. Mints and E. Tyugu, Semantics of a declarative language (Corrigendum) 25 (2) (1987) 139 1410. Y. Toyama, Counterexamples to termination for the direct sum of term rewriting systems 25 (3) (1987) 141–143 1411. J.P. Verjus, On the proof of a distributed algorithm 25 (3) (1987) 145–147 1412. M.B. Dillencourt, A non-Hamiltonian, nondegenerate Delaunay triangulation 25 (3) (1987) 149–151 1413. T.H. Lai and T.H. Yang, On distributed snapshots 25 (3) (1987) 153–158 1414. A. Klapper, A lower bound on the complexity of the convex hull problem for simple polyhedra 25 (3) (1987) 159–161 1415. Ö. Babao˜glu, Stopping times of distributed consensus protocols: A probabilistic analysis 25 (3) (1987) 163–169 1416. S. Kawai, Local authentication in insecure environments 25 (3) (1987) 171–174 1417. M.J. Fischer and N. Immerman, Interpreting logics of knowledge in propositional dynamic logic with converse 25 (3) (1987) 175–181 1418. T.-C. Chung and J.-W. Cho, History sensitive string for multiple alphabets 25 (3) (1987) 183–188
Reference List / Information Processing Letters 78 (2001) 337–448 373 1419. T.H. Tse, On the detection of unstructuredness in flowgraphs 25 (3) (1987) 189–193 1420. D. Zöbel, Transformations for communication fairness in CSP 25 (3) (1987) 195–198 1421. N.A. Alexandridis and P.D. Tsanakas, An encoding scheme for the efficient representation of hierarchical image structures 25 (3) (1987) 199–206 1422. J.M. Morris, Varieties of weakest liberal preconditions 25 (3) (1987) 207–210 1423. J.-M. Autebert, P. Flajolet and J. Gabarro, Prefixes of infinite words and ambiguous context-free languages 25 (4) (1987) 211–216 1424. B. Brustmann and I. Wegener, The complexity of symmetric functions in bounded-depth circuits 25 (4) (1987) 217–219 1425. E. Ochmański, Inevitability in concurrent systems 25 (4) (1987) 221–225 1426. R. Kemp, A note on the number of leftist trees 25 (4) (1987) 227–232 1427. J.G. Wiltink, A deficiency of natural deduction 25 (4) (1987) 233–234 1428. A. Apostolico, Remark on the Hsu–Du new algorithm for the longest common subsequence problem 25 (4) (1987) 235–236 1429. D. Gries, A. Pascoletti and L. Sbriz, Horner’s rule and the computation of linear recurrences 25 (4) (1987) 237–240 1430. A.V. Goldberg and S.A. Plotkin, Parallel (∆ + 1)-coloring of constant-degree graphs 25 (4) (1987) 241– 245 1431. C. Levcopoulos, An ( √ n) lower bound for the nonoptimality of the greedy triangulation 25 (4) (1987) 247–251 1432. M. Reichling, A simplified solution of the n queens’ problem 25 (4) (1987) 253–255 1433. A.O. Buda, Multiprocessor automata 25 (4) (1987) 257–261 1434. S.N. Bhatt and S.S. Cosmadakis, The complexity of minimizing wire lengths in VLSI layouts 25 (4) (1987) 263–267 1435. O. Fries, K. Mehlhorn, S. Näher and A. Tsakalidis, A log log n data structure for three-sided range queries 25 (4) (1987) 269–273 1436. A.W. Appel, Garbage collection can be faster than stack allocation 25 (4) (1987) 275–279 1437. V. Raghavan and S.M. Venkatesan, On bounds for a board covering problem 25 (5) (1987) 281–284 1438. J.S. Salowe and W.L. Steiger, Stable unmerging in linear time and constant space 25 (5) (1987) 285–294 1439. K. Venkatesh, T. Radhakrishnan and H.F. Li, Optimal checkpointing and local recording for domino-free rollback recovery 25 (5) (1987) 295–303 1440. J.R. Nawrocki and J. Martinek, A storage allocation method with invalidating dangling references 25 (5) (1987) 305–310 1441. C. Calude, Super-exponentials nonprimitive recursive, but rudimentary 25 (5) (1987) 311–315 1442. S.S. Ravi and H.B. Hunt III, An application of the Planar Separator Theorem to counting problems 25 (5) (1987) 317–321 1443. D. Gries and I. Stojmenović, A note on Graham’s convex hull algorithm 25 (5) (1987) 323–327 1444. Y. Zhu and T.-Y. Cheung, A new distributed breadth-first-search algorithm 25 (5) (1987) 329–333 1445. R. Surós and E. Montagne, Fitted diagonals for reducing I/O bandwidth in systolic systems 25 (5) (1987) 335–341 1446. S.A. Friedberg and G.L. Peterson, An efficient solution to the mutual exclusion problem using weak semaphores 25 (5) (1987) 343–347 1447. G. Tel and J. van Leeuwen, Comments on “A distributed algorithm for distributed termination” (Letter to the Editor) 25 (5) (1987) 349 1448. K. Krause, L.L. Larmore and D.J. Volper, Packing items from a triangular distribution 25 (6) (1987) 351–361 1449. J. Jȩdrzejowicz, Nesting of shuffle closure is important 25 (6) (1987) 363–367 1450. J. Pallo, On the rotation distance in the lattice of binary trees 25 (6) (1987) 369–373 1451. R.A. Baeza-Yates, Some average measures in m-ary search trees 25 (6) (1987) 375–381 1452. S. Moran, Generalized lower bounds derived from Hastad’s main lemma 25 (6) (1987) 383–388 1453. M. Kunde and H. Steppat, On the worst-case ratio of a compound multiprocessor scheduling algorithm 25 (6) (1987) 389–396 1454. I. V˘rto, The area-time complexity of the VLSI counter 25 (6) (1987) 397–400 1455. F. Peper, Determining connected components in linear time by a linear number of processors 25 (6) (1987) 401–406
Page 1 and 2: Information Processing Letters 78 (
Page 3 and 4: Reference List / Information Proces
Page 35: Reference List / Information Proces
Page 87 and 88:
Reference List / Information Proces
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?