External Links

    Journal: Inf. Process. Lett.

    Volume 27, Issue 6

    275 -- 280JirĂ­ Matousek. Line Arrangements and Range Search
    281 -- 285Aldo de Luca, Stefano Varricchio. On the Factors of the Thue-Morse Word on Three Symbols
    287 -- 290Hans Leo Bodlaender. A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors
    291 -- 297Meichun Hsu, Stuart E. Madnick. Shifting Timestamps for Concurrency Control in an Information Hierarchy
    299 -- 307Shay Kutten. Optimal Fault-Tolerant Distributed Construction of a Spanning Forest
    309 -- 313Ewa Orlowska. Proof System for Weakest Prespecification
    315 -- 318M. A. Sridhar. On the Connectivity of the De Bruijn Graph
    319 -- 321Xiaoqiu Huang. A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost Function
    323 -- 326David Fernández-Baca. Nonserial Dynamic Programming Formulations of Satisfiability

    Volume 27, Issue 5

    221 -- 225Carla D. Savage. Recognizing Majority on a One-Way Mesh
    227 -- 236Hermann Jung, Kurt Mehlhorn. Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees
    237 -- 243Krishnaprasad Thirunarayan. On the Computability of Circumscription
    245 -- 248Bob P. Weems. A Study of Page Arrangements for Extendible Hashing
    249 -- 252Ashok Kumar, Vishv M. Malhotra. A New Computation Rule for Prolog
    253 -- 258Kozo Itano, Yutaka Sato, Hidemi Hirai, Tomoyoshi Yamagata. An Incremental Pattern Matching Algorithm for the Pipelined Lexical Scanner
    259 -- 263Harold N. Gabow, Robert Endre Tarjan. A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest
    265 -- 270Mirko Krvanek. The Complexity of Ultrametric Partitions on Graphs
    271 -- 274Ganesan Ramalingam, C. Pandu Rangan. A Unified Approach to Domination Problems on Interval Graphs

    Volume 27, Issue 4

    167 -- 168Yung H. Tsin. On Handling Vertex Deletion in Updating Spanning Trees
    169 -- 174K. V. S. Ramarao, Robert Daley, Rami G. Melhem. Message Complexity of the Set Intersection Problem
    175 -- 179Hans Rohnert. Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons
    181 -- 188Richard Koo, Sam Toueg. Effects of Message Loss on the Termination of Distributed Protocols
    189 -- 194Ulrich Faigle, Rainer Schrader. On the Convergence of Stationary Distributions in Simulated Annealing Algorithms
    195 -- 199Abdol-Hossein Esfahanian, S. Louis Hakimi. On Computing a Conditional Edge-Connectivity of a Graph
    201 -- 203Andrzej Szepietowski. Remarks on Languages Acceptable in log n Space
    205 -- 213Dominique Roelants van Baronaigien, Frank Ruskey. Generating t-ary Trees in A-Order
    215 -- 219Khaled M. Bugrara, Paul Walton Purdom Jr.. An Exponential Lower Bound for the Pure Literal Rule

    Volume 27, Issue 3

    111 -- 117Leszek Holenderski, Andrzej Szalas. Propositional Description of Finite Cause-Effect Structures
    119 -- 123David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis. On Generating All Maximal Independent Sets
    125 -- 128Kurt Mehlhorn. A Faster Approximation Algorithm for the Steiner Problem in Graphs
    129 -- 132Sharat Chandran, Azriel Rosenfeld. Order Statistics on a Hypercube
    133 -- 139Alan A. Bertossi. Parallel Circle-Cover Algorithms
    141 -- 145Stephen A. Cook, Michael Luby. A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula
    147 -- 150Joel Berman, Willem J. Blok. Positive Boolean Dependencies
    151 -- 157Osamu Watanabe. On Hardness of One-Way Functions
    159 -- 165Jacek Leszczylowski, Staffan Bonnier, Jan Maluszynski. Logic Programming with External Procedures: Introducing S-Unification

    Volume 27, Issue 2

    57 -- 61Bogdan S. Chlebus. A Parallel Bucket Sort
    63 -- 67Jacek Witaszek. A Practical Method for Finding the Optimum Postponement Transformation for LR(k) Parsers
    69 -- 74Mukesh Singhal, Yelena Yesha. A Polynomial Algorithm for Computation of the Probability of Conflicts in a Database Under Arbitrary Data Access Distribution
    75 -- 78Satoru Miyano. A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem
    79 -- 83Chin-Chen Chang, C. H. Chang. An Ordered Minimal Perfect Hashing Scheme with Single Parameter
    85 -- 89Robin Liu, Simeon C. Ntafos. On Decomposing Polygons into Uniformly Monotone Parts
    91 -- 93Franz Baader. A Note on Unification Type Zero
    95 -- 98Ravi S. Sandhu. Cryptographic Implementation of a Tree Hierarchy for Access Control
    99 -- 102Nicholas J. Patterson, Kenneth J. Supowit. Finding the Vertices Nearest to a Point in a Hypercube
    103 -- 109Alan M. Frieze. On the Random Construction of Heaps

    Volume 27, Issue 1

    1 -- 7M. Balakrishnan, S. Sutarwala, Arun K. Majumdar, Dilip K. Banerji, James G. Linders. A Semantic Approach for Modular Synthesis of VLSI Systems
    13 -- 15Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju. Sorting with Efficient Use of Special-Purpose Sorters
    17 -- 21Ganesan Ramalingam, C. Pandu Rangan. Total Domination in Interval Graphs Revisited
    23 -- 28G. Lyon. A Tagless Marking That is Linear Over Subtrees
    29 -- 33Mark B. Josephs. The Data Refinement Calculator for Z Specifications
    35 -- 41Doug Lea. Digital and Hilbert k-d Trees
    43 -- 51Alan Gibbons, Amos Israeli, Wojciech Rytter. Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs
    runs on