External Links

    Journal: Inf. Process. Lett.

    Volume 12, Issue 5

    211 -- 212Jon Mauney, Charles N. Fischer. An Improvement to Immediate Error Detection in Strong LL(1) Parsers
    213 -- 216Lloyd K. Konneker, Yaakov L. Varol. A Note on Heuristics for Dynamic Organization of Data Structures
    217 -- 220Marc Snir. On the Complexity of Simplifying Quadratic Forms
    221 -- 226David M. Harland. On Facilities for Interprocess Communication
    227 -- 232Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier. Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems
    233 -- 0Jean-Jacques Pansiot. A Note on Post s Correspondence Problem
    234 -- 236Wojciech Rytter. An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads
    237 -- 238Bing-Chao Huang. An Algorithm for Inverting a Permutation
    239 -- 243Józef Winkowski. Protocols of Accessing Overlapping Sets of Resources
    244 -- 250Maxime Crochemore. An Optimal Algorithm for Computing the Repetitions in a Word
    251 -- 254Moshe Y. Vardi. The Decision Problem for Database Dependencies
    255 -- 258Jürgen Ebert. A Sensitive Transitive Closure Algorithm

    Volume 12, Issue 4

    161 -- 164Franco P. Preparata, Kenneth J. Supowit. Testing a Simple Polygon for Monotonicity
    165 -- 167Caroline M. Eastman. Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees
    168 -- 173Mark H. Overmars, Jan van Leeuwen. Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems
    174 -- 178Christiane Frougny. Simple Deterministic NTS Languages
    179 -- 181Henk Meijer. A Note on A Cryptosystem for Multiple Communication
    182 -- 183Martin E. Hellman. Another Cryptanalytic Attack on A Cryptosystem for Multiple Communication
    184 -- 187Thomas Ottmann, Arto Salomaa, Derick Wood. Sub-Regular Grammar Forms
    188 -- 192Ichiro Semba. Generation of all the Balanced Parenthesis Strings in Lexicographical Order
    193 -- 195Aldo de Luca. A Combinatorial Property of the Fibonacci Words
    196 -- 198Eric C. R. Hehner, R. K. Shyamasundar. An Implementation of P and V
    199 -- 202David Maier, Sharon C. Salveter. Hysterical B-trees
    203 -- 205Christos H. Papadimitriou, Mihalis Yannakakis. On Minimal Eulerian Graphs
    206 -- 209Masao Iri, Kazuo Murota, Shouichi Matsui. Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane

    Volume 12, Issue 3

    111 -- 114Bruno Courcelle. The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA s
    115 -- 116Gary L. Peterson. Myths About the Mutual Exclusion Problem
    117 -- 120Will E. Leland, Raphael A. Finkel, Li Qiao, Marvin H. Solomon, Leonard Uhr. High Density Graphs for Processor Interconnection
    121 -- 122Ronald V. Book. The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen
    123 -- 126Gerhard Lischke. Two Types of Properties for Complexity Measures
    127 -- 132Reinhard Wilhelm. A Modified Tree-to-Tree Correction Problem
    133 -- 137Robert J. Fowler, Mike Paterson, Steven L. Tanimoto. Optimal Packing and Covering in the Plane are NP-Complete
    138 -- 141Jerzy W. Jaromczyk. Linear Decision Trees are too Weak for Convex Hull Problem
    142 -- 145Alberto Bertoni, Giancarlo Mauri. On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems
    146 -- 150W. Erni, R. Lapsien. On the Time and Tape Complexity of Weak Unification
    151 -- 159Paolo Ancilotti, Maurelio Boari. Information Streams Sharing a Finite Buffer: Protection Problems

    Volume 12, Issue 2

    55 -- 58Michael Hatzopoulos, John G. Kollias. Optimal Policy for Database Backup and Recovery
    59 -- 62David M. Harland. Concurrency in a Language Employing Messages
    63 -- 67Ingemar Ingemarsson, C. K. Wong. A User Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function
    68 -- 70Jean-Jacques Pansiot. The Morse Sequence and Iterated Morphisms
    71 -- 75Allan Borodin, Leonidas J. Guibas, Nancy A. Lynch, Andrew Chi-Chih Yao. Efficient Searching Using Partial Ordering
    76 -- 78Claus-Peter Schnorr. How Many Polynomials can be Approximated Faster Than They can be Evaluated?
    79 -- 82Joxan Jaffar. Presburger Arithmetic With Array Segments
    83 -- 88David Steinberg, Michael Rodeh. A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area
    89 -- 92Yossi Shiloach. Another Look at the Degree Constrained Subgraph Problem
    93 -- 98Kurt Mehlhorn, Mark H. Overmars. Optimal Dynamization of Decomposable Searching Problems
    99 -- 102Mark H. Overmars. General Methods for All Elements and All Pairs Problems
    103 -- 105Silvio Micali. Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata
    106 -- 108Martin Tompa. An Extension of Savitch s Theorem to Small Space Bounds

    Volume 12, Issue 1

    1 -- 4S. Mauceri, Antonio Restivo. A Family of Codes Commutatively Equivalent to Prefix Codes
    5 -- 8Krzysztof Dudzinski, Andrzej Dydek. On a Stable Minimum Storage Merging Algorithm
    9 -- 12Eugene L. Lawler, Charles U. Martel. Scheduling Periodically Occurring Tasks on Multiple Processors
    13 -- 16Christian Choffrut. A Closure Property of Deterministic Context-Free Languages
    17 -- 19Nai-Kuan Tsao. The Numerical Instability of Bini s Algorithm
    20 -- 22Harold N. Gabow. A Linear-Time Recognition Algorithm for Interval Dags
    23 -- 25Dorothy E. Denning, Fred B. Schneider. Master Keys for Group Sharing
    26 -- 30Eric C. R. Hehner. Bunch Theory: A Simple Set Theory for Computer Science
    31 -- 32Sue Whitesides. An Algorithm for Finding Clique Cut-Sets
    33 -- 35Pavol Hell, David G. Kirkpatrick. On Generalized Matching Problems
    36 -- 39Maurice Bruynooghe. Solving Combinatorial Search Problems by Intelligent Backtracking
    40 -- 45Errol L. Lloyd. Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources
    46 -- 48Stefano Ceri, Giuseppe Pelagatti. An Upper Bound on the Number of Execution Nodes for a Distributed Join
    49 -- 53Mark H. Overmars, Jan van Leeuwen. Some Principles for Dynamizing Decomposable Searching Problems
    54 -- 0Leslie G. Valiant. Addendum: Computing Multivariate Polynomials in Parallel
    runs on