External Links

    Journal: Inf. Process. Lett.

    Volume 11, Issue 4/5

    147 -- 151Alfred Laut. Safe Procedural Implementations of Algebraic Types
    152 -- 155Jan Paredaens, F. Ponsaert. Grant Levels in an Authorization Mechanism
    156 -- 161Greg N. Frederickson. Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms
    162 -- 0Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier. A Note on the Parallel Complexity of Computing the Rank of Order n Matrices
    163 -- 167David R. Hanson. Code Improvement Via Lazy Evaluation
    168 -- 171J. H. ter Bekke. Convertibility in Databases
    172 -- 179Alberto Pettorossi. Derivation of an O(k² log n) Algorithm for Computing Order-k Fibonacci Numbers From the O(k³ log n) Matrix Multiplication Method
    180 -- 185M. Howard Williams. Cubic Map Configurations
    186 -- 189M. Howard Williams. Batch Sizes for the Batching Method of Colouring Planar Maps
    190 -- 192Mila E. Majster-Cederbaum. A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs
    193 -- 198Rossella Petreschi, Bruno Simeone. A Switching Algorithm for the Solution of Quadratic Boolean Equations
    199 -- 203R. K. Arora, S. P. Rana. Heuristic Algorithms for Process Assignment in Distributed Computing Systems
    204 -- 210Hiroya Kawai. A Formal System for Parallel Programs in Discrete Time and Space
    211 -- 217J. ten Hoopen. Consecutive Retrieval with Redundancy: An Optimal Linear and an Optimal Cyclic Arrangement and Their Storage Space Requirements
    218 -- 223Peter Kandzia, Margret Mangelmann. On Covering Boyce-Codd Normal Forms
    224 -- 228Seppo Pajunen. On Two Theorems of Lenstra
    229 -- 231Alfons J. Jammel, Helmut G. Stiegler. On Expected Costs of Deadlock Detection

    Volume 11, Issue 3

    115 -- 118Joseph Y.-T. Leung, M. L. Merrill. A Note on Preemptive Scheduling of Periodic, Real-Time Tasks
    119 -- 125J. M. Robson. Storage Allocation is NP-Hard
    126 -- 0David Avis. Comments on a Lower Bound for Convex Hull Determination
    127 -- 129Arnaldo Moura. A Note on Grammatical Covers
    130 -- 133Thomas A. Bailey, R. Geoff Dromey. Fast String Searching by Finding Subkeys in Subtext
    134 -- 136Francesco Romani. Shortest-Path Problem is not Harder Than Matrix Multiplication
    137 -- 140Hannu Erkiö. Internal Merge Sorting with Delayed Selection
    141 -- 143Nachum Dershowitz. The Schorr-Waite Marking Algorithm Revisited
    144 -- 146Efim B. Kinber. On Inclusion Problem for Deterministic Multitape Automata

    Volume 11, Issue 2

    59 -- 65Lech Banachowski. A Complement to Tarjan s Result about the Lower Bound on the Complexity of the Set Union Problem
    66 -- 67Friedrich J. Urbanek. An O(log n) Algorithm for Computing the n:::th::: Element of the Solution of a Difference Equation
    68 -- 69David Gries, Gary Levin. Computing Fibonacci Numbers (and Similarly Defined Functions) in Log Time
    70 -- 72Jürgen Ebert. A Note on Odd and Even Factors of Undirected Graphs
    73 -- 76Lishing Liu, Alan J. Demers. An Algorithm for Testing Lossless Join Property in Relational Databases
    77 -- 80Franco P. Preparata, Jean Vuillemin. Area-Time Optimal VLSI Networks for Multiplying Matrices
    81 -- 83Kin-Man Chung, Fabrizio Luccio, C. K. Wong. Minimum Number of Steps for Permutation in a Bubble Memory
    84 -- 86Andrew Chi-Chih Yao. A Note on the Analysis of Extendible Hashing
    87 -- 91Manfred Broy. Transformational Semantics for Concurrent Programs
    94 -- 95Jacques Calmet, Rüdiger Loos. An Improvement of Rabin s Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p)
    96 -- 97Charles J. Colbourn, Brendan D. McKay. A Correction to Colbourn s Paper on the Complexity of Matrix Symmetrizability
    98 -- 101Paris C. Kanellakis. On the Computational Complexity of Cardinality Constraints in Relational Databases
    102 -- 109Emilio Luque, Ana Ripoll. Tuning Architecture via Microprogramming
    110 -- 113Ernst L. Leiss. A Note on a Signature System Based on Probabilistic Logic

    Volume 11, Issue 1

    1 -- 4Edsger W. Dijkstra, Carel S. Scholten. Termination Detection for Diffusing Computations
    5 -- 6Wlodzimierz Dobosiewicz. An Efficient Variation of Bubble Sort
    7 -- 8Donald C. S. Allison, M. T. Noga. Selection by Distributive Partitioning
    9 -- 15Tomasz Krawczyk. Error Correction by Mutational Grammars
    16 -- 19Kabekode V. S. Bhat. On the Complexity of Testing a Graph for N-Cube
    20 -- 23Jan Grabowski. The Decidability of Persistence for Vector Addition Systems
    24 -- 26Michael C. Loui. A Note on the Pebble Game
    27 -- 30J. D. Day. On the Internal S-Stability of Rosenbrock Methods
    31 -- 32J. D. Day. Comments on: T. D. Bui On an L-Stable Method for Stiff Differential Equations
    33 -- 36George Loizou. On a Cycle Finding Algorithm
    37 -- 39Donna J. Brown. An Improved BL Lower Bound
    40 -- 43James L. Peterson. A Note on Colored Petri Nets
    44 -- 45Leslie G. Valiant. Computing Multivariate Polynomials in Parallel
    46 -- 48Richard P. Brent, H. T. Kung. On the Area of Binary Tree Layouts
    49 -- 52Charles R. Dyer. A Fast Parallel Algorithm for the Closest Pair Problem
    53 -- 56Luc Devroye. A Note on Finding Convex Hulls Via Maximal Vectors
    runs on