Reference List of Indexed Articles

More documents

Recommendations

Info

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

376 Reference List / Information Processing Letters 78 (2001) 337–448 1532. R.S. Sandhu, Cryptographic implementation of a tree hierarchy for access control 27 (2) (1988) 95–98 1533. N.J. Patterson and K.J. Supowit, Finding the vertices nearest to a point in a hypercube 27 (2) (1988) 99–102 1534. A.M. Frieze, On the random construction of heaps 27 (2) (1988) 103–109 1535. L. Holenderski and A. Szalas, Propositional description of finite cause-effect structures 27 (3) (1988) 111–117 1536. D.S. Johnson, M. Yannakakis and C.H. Papadimitriou, On generating all maximal independent sets 27 (3) (1988) 119–123 1537. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs 27 (3) (1988) 125–128 1538. S. Chandran and A. Rosenfeld, Order statistics on a hypercube 27 (3) (1988) 129–132 1539. A.A. Bertossi, Parallel circle-cover algorithms 27 (3) (1988) 133–139 1540. S.A. Cook and M. Luby, A simple parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula 27 (3) (1988) 141–145 1541. J. Berman and W.J. Blok, Positive Boolean dependencies 27 (3) (1988) 147–150 1542. O. Watanabe, On hardness of one-way functions 27 (3) (1988) 151–157 1543. J. Leszczylowski, S. Bonnier and J. Maluszyński, Logic programming with external procedures: Introducing S-unification 27 (3) (1988) 159–165 1544. Y.H. Tsin, On handling vertex deletion in updating minimum spanning trees 27 (4) (1988) 167–168 1545. K.V.S. Ramarao, R. Daley and R. Melhem, Message complexity of the set intersection problem 27 (4) (1988) 169–174 1546. H. Rohnert, Time and space efficient algorithms for shortest paths between convex polygons 27 (4) (1988) 175–179 1547. R. Koo and S. Toueg, Effects of message loss on the termination of distributed protocols 27 (4) (1988) 181–188 1548. U. Faigle and R. Schrader, On the convergence of stationary distributions in simulated annealing algorithms 27 (4) (1988) 189–194 1549. A.-H. Esfahanian and S.L. Hakimi, On computing a conditional edge-connectivity of a graph 27 (4) (1988) 195–199 1550. A. Szepietowski, Remarks on languages acceptable in log log n space 27 (4) (1988) 201–203 1551. D. Roelants van Baronaigien and F. Ruskey, Generating t-ary trees in A-order 27 (4) (1988) 205–213 1552. K.M. Bugrara and P.W. Purdom, An exponential lower bound for the pure literal rule 27 (4) (1988) 215– 219 1553. C. Savage, Recognizing majority on a one-way mesh 27 (5) (1988) 221–225 1554. H. Jung and K. Mehlhorn, Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees 27 (5) (1988) 227–236 1555. T. Krishnaprasad, On the computability of circumscription 27 (5) (1988) 237–243 1556. B.P. Weems, A study of page arrangements for extendible hashing 27 (5) (1988) 245–248 1557. A. Kumar and V.M. Malhotra, A new computation rule for Prolog 27 (5) (1988) 249–252 1558. K. Itano, Y. Sato, H. Hirai and T. Yamagata, An incremental pattern matching algorithm for the pipelined lexical scanner 27 (5) (1988) 253–258 1559. H.N. Gabow and R.E. Tarjan, A linear-time algorithm for finding a minimum spanning pseudoforest 27 (5) (1988) 259–263 1560. M. Křivánek, The complexity of ultrametric partitions on graphs 27 (5) (1988) 265–270 1561. G. Ramalingam and C. Pandu Rangan, A unified approach to domination problems on interval graphs 27 (5) (1988) 271–274 1562. J. Matoušek, Line arrangements and range search 27 (6) (1988) 275–280 1563. A. De Luca and S. Varricchio, On the factors of the Thue–Morse word on three symbols 27 (6) (1988) 281–285 1564. H.L. Bodlaender, A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors 27 (6) (1988) 287–290 1565. M. Hsu and S.E. Madnick, Shifting timestamps for concurrency control in an information hierarchy 27 (6) (1988) 291–297 1566. S. Kutten, Optimal fault-tolerant distributed construction of a spanning forest 27 (6) (1988) 299–307 1567. E. Orlowska, Proof system for weakest prespecification 27 (6) (1988) 309–313 1568. M.A. Sridhar, On the connectivity of the De Bruijn graph 27 (6) (1988) 315–318
Reference List / Information Processing Letters 78 (2001) 337–448 377 1569. X. Huang, A lower bound for the edit-distance problem under an arbitrary cost function 27 (6) (1988) 319–321 1570. D. Fernández-Baca, Nonserial dynamic programming formulations of satisfiability 27 (6) (1988) 323– 326 1571. M. Sakkinen, Comments on “Manipulation of data structures without pointers” (Letter to the Editor) 27 (6) (1988) 327–328 1572. M. Latteux and E. Timmerman, Bifaithful starry transductions 28 (1) (1988) 1–4 1573. G.F. Italiano, Finding paths and deleting edges in directed acyclic graphs 28 (1) (1988) 5–11 1574. W. Szpankowski, The evaluation of an alternative sum with applications to the analysis of some data structures 28 (1) (1988) 13–19 1575. D.A. Lamb and R. Dawes, Testing for class membership in multi-parent hierarchies 28 (1) (1988) 21–25 1576. J.D.P. Rolim and S.A. Greibach, On the IO-complexity and approximation languages 28 (1) (1988) 27– 31 1577. J. Jȩdrzejowicz, Infinite hierarchy of expressions containing shuffle closure operator 28 (1) (1988) 33–37 1578. W.-P. Chin and S. Ntafos, Optimum watchman routes 28 (1) (1988) 39–44 1579. A. Dwelly, Synchronizing the I/O behavior of functional programs with feedback 28 (1) (1988) 45–51 1580. S. Olariu, Paw-free graphs (Short Note) 28 (1) (1988) 53–54 1581. W.W. Kirchherr, Transposition of an l × l matrix requires (log l) reversals on conservative Turing machines 28 (2) (1988) 55–59 1582. H. Gazit and G.L. Miller, An improved parallel algorithm that computes the BFS numbering of a directed graph 28 (2) (1988) 61–65 1583. F. Dehne and I. Stojmenovic, An O( √ n) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors 28 (2) (1988) 67–70 1584. V. Pan, Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations 28 (2) (1988) 71–75 1585. J. Engelfriet and H.J. Hoogeboom, Prefix and equality languages of rational functions are co-context-free 28 (2) (1988) 77–79 1586. D.P. Bovet, S. De Agostino and R. Petreschi, Parallelism and the feedback vertex set problem 28 (2) (1988) 81–85 1587. Y. Auffray, Linear strategy for propositional modal resolution 28 (2) (1988) 87–92 1588. J. Ebert, Computing Eulerian trails 28 (2) (1988) 93–97 1589. J.H. Anderson and M.G. Gouda, Atomic semantics of nonatomic programs 28 (2) (1988) 99–103 1590. C.A. Schevon and J.S. Vitter, A parallel algorithm for recognizing unordered depth-first search 28 (2) (1988) 105–110 1591. A. Brandwajn, Load imbalance in DASD dynamic reconnection 28 (3) (1988) 111–119 1592. P. Mishra, Strictness analysis of the untyped λ-calculus 28 (3) (1988) 121–125 1593. J. Aguilar-Martin and C. Alsina, Characterizations of some rescaling functions 28 (3) (1988) 127–132 1594. M.A. Weiss and R. Sedgewick, Bad cases for Shaker-sort 28 (3) (1988) 133–136 1595. J.F. Morrison, Parallel p-adic computation 28 (3) (1988) 137–140 1596. F. Luccio, A. Pietracaprina and G. Pucci, A probabilistic simulation of PRAMs on a bounded degree network 28 (3) (1988) 141–147 1597. M.Y. Chan and W.L. Chung, Optimal multidisk partial match file designs 28 (3) (1988) 149–155 1598. H. Ural and B. Yang, A structural test selection criterion 28 (3) (1988) 157–163 1599. C. Ó’Dúnlaing, A tight lower bound for the complexity of path-planning for a disc 28 (4) (1988) 165–170 1600. M. Imase and Y. Manabe, Fault-tolerant routings in a κ-connected network 28 (4) (1988) 171–175 1601. M.J. Chung and M.S. Krishnamoorthy, Algorithms of placing recovery points 28 (4) (1988) 177–181 1602. J. Du and J.Y.-T. Leung, Scheduling tree-structured tasks with restricted execution times 28 (4) (1988) 183–188 1603. D.J. Rosenkrantz and H.B. Hunt III, Matrix multiplication for finite algebraic systems 28 (4) (1988) 189–192 1604. Y. Takada, Grammatical inference for even linear languages based on control sets 28 (4) (1988) 193–199 1605. G.-I. Chen and T.-H. Lai, Preemptive scheduling of independent jobs on a hypercube 28 (4) (1988) 201– 206 1606. G. Brassard and S. Kannan, The generation of random permutations on the fly 28 (4) (1988) 207–212 1607. I. Suzuki, Proving properties of a ring of finite-state machines 28 (4) (1988) 213–214
Page 1 and 2: Information Processing Letters 78 (
Page 3 and 4: Reference List / Information Proces
Page 39: Reference List / Information Proces
Page 91 and 92:
Reference List / Information Proces
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?