External Links

    Journal: Inf. Process. Lett.

    Volume 2, Issue 2

    31 -- 33Armin B. Cremers, Hermann A. Maurer, Otto Mayer. A Note on Leftmost Restricted Random Context Grammars
    34 -- 38S. I. Roschke, Antonio L. Furtado. An Algorithm for Obtaining the Chromatic Number and an Optimal Coloring of a Graph
    39 -- 42Joël Coffy. On Computing the Time Complexity of Transitive Closure Algorithms
    43 -- 46Azriel Rosenfeld, David L. Milgram. Parallel / Sequential Array Automata
    47 -- 51Gary Lindstrom. Scanning List Structures Without Stacks or Tag Bits
    52 -- 54Edward N. Adams III. Another Representation of Binary Tree Traversal
    55 -- 59D. Holnapy, Miklós Szöts, A. Botár. A Generalization of the Method of Finite Differences
    runs on