External Links

    Journal: Inf. Process. Lett.

    Volume 26, Issue 6

    277 -- 286Ganesh Gopalakrishnan, Mandayam K. Srivas. Implementing Functional Programs Using Mutable Abstract Data Types
    287 -- 289Tat-hung Chan. The Boundedness Problem for Three-Dimensional Vector Addition Systems with States
    291 -- 293Bruce M. Maggs, Serge A. Plotkin. Minimum-Cost Spanning Tree as a Path-Finding Problem
    295 -- 299Richard J. Cole. An Optimally Efficient Selection Algorithm
    301 -- 305Israel Cidon. Yet Another Distributed Depth-First-Search Algorithm
    307 -- 312Rolf G. Karlsson, Mark H. Overmars. Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems
    313 -- 319Ludwik Czaja. Cause-Effect Structures
    321 -- 324Marc Bezem, Jan van Leeuwen. On Estimating the Complexity of Logarithmic Decompositions
    325 -- 328John R. Gilbert. Some Nested Dissection Order is Nearly Optimal

    Volume 26, Issue 5

    223 -- 230Claudio Arbib. A Polynomial Characterization of Some Graph Partitioning Problems
    231 -- 236Karel Culik II, Juhani Karhumäki. On Totalistic Systolic Networks
    237 -- 241Andrzej Sieminski. Fast Decoding of the Huffman Codes
    243 -- 246Carroll Morgan. Data Refinement by Miracles
    247 -- 250Patrick W. Dymond. Input-Driven Languages are in log n Depth
    251 -- 253Eljas Soisalon-Soininen, Jorma Tarhio. Looping LR Parsers
    255 -- 261Klaus Hinrichs, Jürg Nievergelt, Peter Schorn. Plane-Sweep Solves the Closest Pair Problem Elegantly
    263 -- 267Olivier Y. de Vel, E. V. Krishnamurthy. An Iterative Pipelined Array Architecture for the Generalized Matrix Inversion
    269 -- 270Stephen A. Cook. Short Propositional Formulas Represent Nondeterministic Computations
    271 -- 272Erkki Mäkinen. On the Rotation Distance of Binary Trees
    273 -- 276Joel I. Seiferas. A Variant of Ben-Or s Lower Bound for Algebraic Decision Trees

    Volume 26, Issue 4

    165 -- 171Krzysztof R. Apt, Luc Bougé, Ph. Clermont. Two Normal Form Theorems for CSP Programs
    173 -- 179Michael T. Goodrich. Finding the Convex Hull of a Sorted Point Set in Parallel
    181 -- 186Ursula Martin. Extension Functions for Multiset Orderings
    187 -- 191Shlomit S. Pinter, Yaron Wolfstahl. Embedding Ternary Trees in VLSI Arrays
    193 -- 204Ulrich Güntzer, Manfred Paul. Jump Interpolation Search Trees and Symmetric Binary Numbers
    205 -- 208Tadao Takaoka. A Decomposition Rule for the Hoare Logic
    209 -- 215Alberto Apostolico, Susanne E. Hambrusch. Finding Maximum Cliques on Circular-Arc Graphs
    217 -- 222C. Baleanu, D. Tomescu. An Architecture for Symbolic Processing

    Volume 26, Issue 3

    111 -- 116Andrzej Szalas. Arithmetical Axiomatization of First-Order Temporal Logic
    117 -- 119Ondrej Sýkora, Imrich Vrto. Tight Chip Area Lower Bounds for String Matching
    121 -- 126M. Zhu, N. K. Loh, Pepe Siy. Towards the Minimum Set of Primitive Relations in Temporal Logic
    127 -- 134Y. Hou. Trinity Algebra and its Application to Machine Decompositions
    135 -- 143A. S. M. Sajeev, J. Olszewski. Manipulation of Data Structures Without Pointers
    145 -- 151Shlomo Moran, Yaron Wolfstahl. Extended Impossibility Results for Asynchronous Complete Networks
    153 -- 155Johan Håstad. One-Way Permutations in NC0
    155 -- 162Michael R. Fellows, Michael A. Langston. Nonconstructive Advances in Polynomial-Time Complexity

    Volume 26, Issue 2

    55 -- 59Yves Métivier, Edward Ochmanski. On Lexicographic Semi-Commutations
    61 -- 64Xiaojun Shen, Herbert Edelsbrunner. A Tight Lower Bound on the Size of Visibility Graphs
    65 -- 70Michaël Rusinowitch. On Termination of the Direct Sum of Term-Rewriting Systems
    71 -- 75Andranik Mirzaian. A Halving Technique for the Longest Stuttering Subsequence Problem
    77 -- 80Jan Magott. Performance Evaluation of Concurrent Systems Using Conflict-Free and Persistent Petri Nets
    81 -- 88Zvi Galil, Moti Yung. Partitioned Encryption and Achieving Simultaneity by Partitioning
    89 -- 93C. Mathieu, Claude Puech, Hossein Yahia. Average Efficiency of Data Structures for Binary Image Processing
    95 -- 97K. G. Subramanian, Rani Siromoney, P. J. Abisha. A D0L-T0L Public Key Cryptosystem
    99 -- 104Ajay K. Gupta, Susanne E. Hambrusch. Optimal Three-Dimensional Layouts of Complete Binary Trees
    105 -- 110Matthew Thazhuthaveetil, Andrew R. Pleszkun. On the Structural Locality of Reference in LISP List Access Streams

    Volume 26, Issue 1

    1 -- 4Brigitte Jaumard, Bruno Simeone. On the Complexity of the Maximum Satisfiability Problem for Horn Formulas
    5 -- 18James R. Driscoll, Sheau-Dong Lang, LeRoy A. Franklin. Modeling B-Tree Insertion Activity
    19 -- 21Alfs T. Berztiss. A Notation for Distributed Operations
    23 -- 28Jean Berstel, Srecko Brlek. On the Length of Word Chains
    29 -- 32Ronald V. Book, Hai-Ning Liu. Rewriting Systems and Word Problems in a Free Partially Commutative Monoid
    33 -- 36Svante Carlsson. The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues
    37 -- 43Janet Incerpi, Robert Sedgewick. Practical Variations of Shellsort
    45 -- 50Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie. Equivalence of Multistage Interconnection Networks
    51 -- 53László Babai. Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy
    runs on