External Links

    Journal: Inf. Process. Lett.

    Volume 29, Issue 6

    277 -- 281Mila E. Majster-Cederbaum. On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces
    283 -- 287Bernard M. Waxman, Makoto Imase. Worst-Case Performance of Rayward-Smith s Steiner Tree Heuristic
    289 -- 292Stephan Olariu. On the Unimodality of Convex Polygons
    293 -- 296Carroll Morgan. Auxiliary Variables in Data Refinement
    297 -- 300Irène Guessarian, Lutz Priese. On the Minimal Number of * Operators to Model Regularity in Fair SCCS
    301 -- 305David Alex Lamb. Benign Side Effects
    307 -- 313Natarajan Shankar, V. Ramachandran. Efficient Parallel Circuits and Algorithms for Division
    315 -- 317Tetsuo Moriya. Closure Property of Principal Cones Under Substitution
    319 -- 326Boris S. Veroy. Average Complexity of Divide-and-Conquer Algorithms
    327 -- 329Torben Hagerup. On Saving Space in Parallel Computation (Note)

    Volume 29, Issue 5

    221 -- 227Giorgio Gallo, Maria Grazia Scutellà. Polynomially Solvable Satisfiability Problems
    229 -- 232H. J. Boom. Lazy Variable-Renumbering Makes Substitution Cheap
    233 -- 239Boris S. Veroy. Optimal Search Algorithm for a Minimum of a Discrete Periodic Bimodal Function
    241 -- 246Peter Schorn. A Canonical Simplifier for Trigonometric Expressions in the Kinematic Equation
    247 -- 254Füsun Özgüner, Cevdet Aykanat. A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor
    255 -- 256Marek Chrobak, Richard Harter. A Note on Random Sampling
    257 -- 263William McCune. Un-Skolemizing Clause Sets
    265 -- 270Micha Sharir. The Shortest Watchtower and Related Problems for Polyhedral Terrains
    271 -- 274Alessandro D Atri, Marina Moscarini. On Hypergraph Acyclicity and Graph Chordality
    275 -- 276Pratul Dublish. An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon

    Volume 29, Issue 4

    165 -- 169Jerzy R. Nawrocki, A. Urbanski. Fixed-Size Blocks Optimization
    171 -- 175Symeon Bozapalidis, S. Ioulidis. Varieties of Formal Series on Trees and Eilenberg s Theorem
    177 -- 182Sang Cho, Dung T. Huynh. On a Complexity Hierarchy Between L and NL
    183 -- 189Aris M. Ouksel, Peter Scheuermann. Implicit Data Structures for Linear Hashing Schemes
    191 -- 198Chan-Ik Park, Kyu Ho Park, Myunghwan Kim. Efficient Backward execution in and/or Process Model
    199 -- 200Ernst L. Leiss. On the Degree of Dominator Trees
    201 -- 206F. E. J. Kruseman. On a Recursive Ascent Parser
    207 -- 211Fabio A. Schreiber, Giuseppe Rosolini. An Algebraic Description of Some State-Dependent Failure Mechanisms
    213 -- 220Sakti Pramanik, Myoung-Ho Kim. HCB-Tree: A Height Compressed B-Tree for Parallel Processing

    Volume 29, Issue 3

    111 -- 117Oscar H. Ibarra, Tao Jiang, Bala Ravikumar. Some Subclasses of Context-Free Languages In NC1
    119 -- 123Gregory E. Shannon. A Linear-Processor Algorithm for Depth-First Search in Planar Graphs
    125 -- 130Paliath Narendran, Friedrich Otto. Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule
    131 -- 135Gottfried Vossen. A New Characterization of FD Implication with an Application to Update Anomalies
    137 -- 141Hans Leo Bodlaender. The Complexity of Finding Uniform Emulations on Fixed Graphs
    143 -- 148P. M. van den Broek. Confluence of Indirection Reductions in Graph Rewrite Systems
    149 -- 153Sibsankar Haldar, D. K. Subramanian. Ring Based Termination Detection Algorithm for Distributed Computations
    155 -- 163Bogdan Korel, Janusz W. Laski. Dynamic Program Slicing

    Volume 29, Issue 2

    57 -- 66André Arnold, Paul Crubille. A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems
    67 -- 70Andrzej Szalas. An Incompleteness Result in Process Algebra
    71 -- 74Wojciech Rytter. On Efficient Computations of Costs of Paths on a Grid Graph
    75 -- 79F. Hoffman. Embedding Rectilinear Graphs in Linear Time
    81 -- 86Andrzej Blikle. A Guided Tour of the Mathematics of MetaSoft 88
    87 -- 89Dietmar Wätjen, Erwin Unruh. On the Degree of Synchronization of kl TOL and k1 ETOL Systems
    91 -- 95Aldo de Luca, M. Pelagalli, Stefano Varricchio. Test Sets for Languages of Infinite Words
    97 -- 104Basile Louka, Maurice Tchuente. Dynamic Programming on Two-Dimensional Systolic Arrays

    Volume 29, Issue 1

    1 -- 12Michel Minoux. LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation
    13 -- 18S.-T. Huang. A Fully Distributed Termination Detection Scheme
    19 -- 23Jean-Claude Raoult. Proving Open Properties by Induction
    25 -- 29Matthias Reichling. On the Detection of a Common Intersection of k Convex Objects in the Plane
    31 -- 34F. Warren Burton, Geoff P. McKeown, Victor J. Rayward-Smith. On Process Assignment in Parallel Computing
    35 -- 36Erkki Mäkinen. On Linear Search Heuristics
    37 -- 38M. D. Atkinson, Nicola Santoro. A Practical Algorithm for Boolean Matrix Multiplication
    39 -- 42Joep L. W. Kessels. An Exercise in Proving Self-Stabilization with a Variant Function
    43 -- 51Masataka Sassa, Ikuo Nakata. Time-Optimal Short-Circuit Evaluation of Boolean Expressions
    runs on