External Links

    Journal: Inf. Process. Lett.

    Volume 3, Issue 6

    165 -- 166Per Brinch Hansen. Universal Types in Concurrent Pascal
    167 -- 169Derek A. Zave. A Fast Compacting Garbage Collector
    170 -- 173Jon Louis Bentley, Donald F. Stanat. Analysis of Range Searches in Quad Trees
    174 -- 176Carlo Ghezzi. LL(1) Grammars Supporting an Efficient Error Handling
    177 -- 179Hans F. de Groote. On the Complexity of Quaternion Multiplication
    180 -- 183Stefan Pleszczynski. On the Generation of Permutations
    184 -- 187Martin Rem. On the Programming of Elastic Stores
    188 -- 189Roy A. Keir. Should the Stable Rounding Rule be Radix-Dependent?

    Volume 3, Issue 5

    127 -- 134Constantine Lazos. A Comparison of Simulation Results and a Mathematical Model of a Multiprogramming System
    135 -- 137Josef Kittler. On the Divergence and the Joshi Dependence Measure in Feature Selection
    138 -- 143Jan van Leeuwen. The Membership Question for ET0L-Languages is Polynomially Complete
    144 -- 146Franco P. Preparata, David E. Muller. The Time Required to Evaluate Division-Free Arithmetic Expressions
    147 -- 152H. Asai, S. C. Lee. Design of Queuing Buffer Register Size
    153 -- 163Antony Stevens. An Elementary Computer Algorithm for the Calculation of the Coefficient of Inbreeding
    164 -- 0John F. Reiser, Donald E. Knuth. Erratum: Evading the Drift in Floating-Point Addition
    164 -- 0Stefano Crespi-Reghizzi, Dino Mandrioli. Erratum: A Decidability Theorem for a Class of Vector-Addition Systems
    164 -- 0N. S. Sridharan. Erratum: Computer Generation of Vertex Graphs

    Volume 3, Issue 4

    97 -- 103S. Galand, G. Loncour. Structured Implementation of Symbolic Execution: A First Part in a Program Verifier
    104 -- 109Jacques Cohen. Interpretation of Non-Deterministic Algorithms in Higher-Level Languages
    110 -- 112Fanica Gavril. An Algorithm for Testing Chordality of Graphs
    113 -- 114Gideon Yuval. Finding Near Neighbors in K-Dimensional Space
    115 -- 118Ibrahim Cahit, R. Cahit. On the Graceful Numbering of Spanning Trees
    119 -- 120Ben Wegbreit. Retrieval from Context Trees
    121 -- 124S. De Wolf, G. De Mey. Numerical Methods for Solving Integral Equations of Potential Problems
    125 -- 126J. M. Robson. A Simple Solution to the Interleaved Memory Bandwidth Problem

    Volume 3, Issue 3

    65 -- 66Richard J. Lipton, Robert W. Tuttle. A Synchronization Anomaly
    67 -- 68Chiharu Hosono. On the Cardinality of Some Lattices
    69 -- 70Sebastiaan H. von Solms. On T0L Languages over Terminals
    71 -- 74Subrata Dasgupta, John Tartar. On the Minimization of Control Memories
    75 -- 77Tiko Kameda. On the Vector Representation of the Reachability in Planar Directed Graphs
    78 -- 80Stefano Crespi-Reghizzi, Dino Mandrioli. A Decidability Theorem for a Class of Vector-Addition Systems
    81 -- 83Paolo M. Camerini, Francesco Maffioli. Bounds for 3-Matroid Intersection Problems
    84 -- 87John F. Reiser, Donald E. Knuth. Evading the Drift in Floating-Point Addition
    88 -- 90Ivan Dal Bono, Mauro Diligenti, Concetta Mosca, Antonio Ricci, Antonio Villani. A Simple FORTRAN Support for Computer-Assisted Instruction
    91 -- 96Klaus Weihrauch. Program Schemata with Polynomial Bounded Counters

    Volume 3, Issue 2

    35 -- 36Tadao Takaoka. A Note on the Ambiguity of Context-Free Grammars
    37 -- 38J. A. Campbell. Optimal Use of Storage in a Simple Model of Garbage Collection
    39 -- 42Marvin V. Zelkowitz. Structured Operating System Organization
    43 -- 45Lionel E. Deimel. Remark on the Computational Power of a Turing Machine Variant
    46 -- 50Stefan Arnborg. Abstract Computation Model Used for a Production Compiler
    51 -- 53Robert Endre Tarjan. A Good Algorithm for Edge-Disjoint Branching
    54 -- 56Kojiro Kobayashi. A Note on Extending Equivalence Theories of Algorithms
    57 -- 63N. S. Sridharan. Computer Generation of Vertex Graphs
    64 -- 0Donald E. Knuth, Jayme Luiz Szwarcfiter. Erratum: A Structured Program to Generate all Topological Sorting Arrangements

    Volume 3, Issue 1

    1 -- 7Jack Minker, Gordon J. van der Brug. The Earley Algorithm as a Problem Representation
    8 -- 12Kohei Noshita. Median Selection of 9 Elements in 14 Comparisons
    13 -- 15Robert Endre Tarjan. A New Algorithm for Finding Weak Components
    16 -- 21Lee W. Cooprider, F. Heymans, Pierre-Jacques Courtois, David Lorge Parnas. Information Streams Sharing a Finite Buffer: Other Solutions
    22 -- 24Jan van Leeuwen, Carl H. Smith. An Improved Bound for Detecting Looping Configurations in Deterministic DPA s
    25 -- 28Oscar H. Ibarra. A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata
    29 -- 32David A. Fisher. Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing Environment
    runs on