External Links

    Journal: Inf. Process. Lett.

    Volume 7, Issue 6

    251 -- 255T. H. Merrett. QT Logic: Simpler and More Expressive Than Predicate Calculus
    256 -- 260V. M. Glushkov, G. E. Tseytlin, E. L. Yushchenko. Certain Problems of the Theory of Structured Program Schemes
    261 -- 265K. S. Natarajan, Lee J. White. Optimum Domination in Weighted Trees
    266 -- 269János Demetrovics. On the Number of Candidate Keys
    270 -- 273Miklós Ajtai, János Komlós, Endre Szemerédi. There is no Fast Single Hashing Algorithm
    274 -- 276M. R. Garey, Robert Endre Tarjan. A Linear-Time Algorithm for Finding All Feedback Vertices
    277 -- 278Vishv M. Malhotra, M. Pramodh Kumar, S. N. Maheshwari. An O(|V|³) Algorithm for Finding Maximum Flows in Networks
    279 -- 284Robert Giegerich, Reinhard Wilhelm. Counter-One-Pass Features in One-Pass Compilation: A Formalization Using Attribute Grammars
    285 -- 286Gideon Yuval. A Simple Proof of Strassen s Result
    287 -- 290Emily P. Friedman, Sheila A. Greibach. On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages
    291 -- 295Ludwik Czaja. Parallel Implementation of Path Expressions
    296 -- 298A. Bykat. Convex Hull of a Finite Set of Points in Two Dimensions
    299 -- 303Joseph Shortt. An Iterative Program to Calculate Fibonacci Numbers in O(log n) Arithmetic Operations
    304 -- 307Matti Jakobsson. Huffman Coding in Bit-Vector Compression
    308 -- 311Jukka Teuhola. A Compression Method for Clustered Bit-Vectors
    312 -- 314Douglas W. Clark, C. Cordell Green. A Note on Shared List Structure in LISP

    Volume 7, Issue 5

    209 -- 212Keijo Ruohonen. A Note on Language Equations Involving Morphisms
    213 -- 218Ivan Hal Sudborough. A Note on Weak Operator Precedence Grammars
    219 -- 222Selim G. Akl, Godfried T. Toussaint. A Fast Convex Hull Algorithm
    223 -- 230Ivan Bratko. Proving Correctness of Strategies in the AL1 Assertional Language
    231 -- 232Mark R. Brown. A Storage Scheme for Height-Balanced Trees
    233 -- 236Radha Krishan Arora, R. K. Subramanian. Exploiting the Optimal Paging Algorithms
    237 -- 243Kohei Noshita, Etsuo Masuda, Hajime Machida. On the Expected Behaviors of the Dijkstra s Shortest Path Algorithm for Complete Graphs
    244 -- 249Ludwik Czaja. Implementation Approach to Parallel Systems

    Volume 7, Issue 4

    165 -- 169Gaston H. Gonnet. Notes on the Derivation of Asymptotic Expressions from Summations
    170 -- 172Joost Engelfriet. On Tree Transducers for Partial Functions
    173 -- 174Stanley M. Selkow. New Bounds for the Clique Number of a Graph
    175 -- 179M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan. Triangulating a Simple Polygon
    180 -- 182G. Schachtel. A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 103 Multiplications
    183 -- 184Gian Carlo Bongiovanni, Fabrizio Luccio. On Cahit s Result on Graceful Permutations
    185 -- 188Richard J. Lipton, Raymond E. Miller. A Batching Method for Coloring Planar Graphs
    189 -- 192D. T. Lee, Franco P. Preparata. The All Nearest-Neighbor Problem for Convex Polygons
    193 -- 195Richard A. DeMillo, Richard J. Lipton. A Probabilistic Remark on Algebraic Program Testing
    196 -- 200Jeffrey M. Jaffe. Counting Productions in Context-Free Derivations
    201 -- 204Charles E. Hughes. The Equivalence of Vector Addition Systems to a Subclass of Post Canonical Systems
    205 -- 0F. Warren Burton. Comments on: Sorting by Distributive Partitioning
    206 -- 0Wlodzimierz Dobosiewicz. Author s Reply to Warren Burton s Comments on Distributive Partitioning Sorting

    Volume 7, Issue 3

    127 -- 128Selim G. Akl, Godfried T. Toussaint. An Improved Algorithm to Check for Polygon Similarity
    129 -- 131Sorin Istrail. Tag Systems Generating Thue Irreducible Sequences
    132 -- 136Radha Krishan Arora, R. K. Subramanian. An Optimal Demand Prepaging Algorithm
    137 -- 138Wilfred J. Hansen. A Predecessor Algorithm for Ordered Lists
    139 -- 143Lloyd Allison. Phrase Structures, Non-Determinism and Backtracking
    144 -- 147Gérard P. Huet. An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations
    148 -- 150Franco P. Preparata, Dilip V. Sarwate. An Improved Parallel Processor Bound in Fast Matrix Inversion
    151 -- 153Stefan Sokolowski. A Method for Proving Programming Languages non Context-Free
    154 -- 155Norbert Illies. A Counterexample to the Generalized Aanderaa-Rosenberg Conjecture
    156 -- 158Raymond R. Devillers, Peter E. Lauer. A General Mechanism for Avoiding Starvation with Distributed Control
    159 -- 162Angelika Reiser. A Linear Selection Algorithm for Sets of Elements with Weights

    Volume 7, Issue 2

    65 -- 0William F. McColl. The Maximum Depth of Monotone Formulae
    66 -- 71Yahiko Kambayashi, Takaki Hayashi, Y. Tanaka, Shuzo Yajima. A Linear Storage Space Algorithm for a Reference Structure Index
    72 -- 77A. S. Sethi, V. Rajaraman, P. S. Kenjale. An Error-Correcting Coding Scheme for Alphanumeric Data
    78 -- 85Alexandre Brandwajn, Philippe Kruchten, Jean-Alain Hernandez. ARCADE - A System for Research and Education in Computer Architecture
    86 -- 0Selim G. Akl. Comments on: G. Manacher, An Application of Pattern Matching to a Problem in Geometrical Complexity
    87 -- 91Jon Louis Bentley, Michael Ian Shamos. Divide and Conquer for Linear Expected Time
    92 -- 99Eero Peltola, Hannu Erkiö. Insertion Merge Sorting
    100 -- 102Gheorghe Paun. On the Generative Capacity of Simple Matrix Grammars of Finite Index
    103 -- 106Hanan Samet. A Canonical Form Algorithm for Proving Equivalence of Conditional Forms
    107 -- 111Jan Paredaens. On the Expressive Power of the Relational Algebra
    112 -- 121Maurelio Boari, Antonio Natali. Multiple Access to a Tree in the Context of Readers and Writers Problem
    122 -- 124B. F. Caviness, H. I. Epstein. A Note on the Complexity of Algebraic Differentiation
    125 -- 0Grant A. Cheston. A Correction to a Unilaterally Connected Components Algorithm

    Volume 7, Issue 1

    1 -- 6Wlodzimierz Dobosiewicz. Sorting by Distributive Partitioning
    7 -- 9Danny Dolev, Eliahu Shamir. Commutation Relations of Slices Characterize Some Synchronization Primitives
    10 -- 14Paolo M. Camerini. The Min-Max Spanning Tree Problem and Some Extensions
    15 -- 19Andreas Karayiannis, George Loizou. Cycle Detection in Critical Path Networks
    20 -- 23Shalom Tsur. Analysis of Queuing Networks in Which Processes Exhibit Locality-Transition Behaviour
    24 -- 26Stefano Crespi-Reghizzi, Dino Mandrioli. A Class of Grammar Generating Non-Counting Languages
    27 -- 32Motoaki Terashima, Eiichi Goto. Genetic Order and Compactifying Garbage Collectors
    33 -- 35Karel Culik II. The Decidability of v-Local Catenativity and of Other Properties of D0L Systems
    36 -- 39William E. Howden. Lindenmayer Grammars and Symbolic Testing
    40 -- 41Daniel S. Hirschberg. An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem
    42 -- 43Jan A. Bergstra. What is an Abstract Datatype?
    44 -- 48F. James Rohlf. A Probabilistic Minimum Spanning Tree Algorithm
    49 -- 52Katsushi Inoue, Itsuo Takanami, Akira Nakamura. A Note on Two-Dimensional Finite Automata
    53 -- 55Kenneth R. Anderson. A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set
    56 -- 57Jack Koplowitz, D. Jouppi. A More Efficient Convex Hull Algorithm
    58 -- 62Dennis de Champeaux. Substad: For Fast Substitution in LISP, with an Application on Unification
    runs on