Journals in DBLP

Inf. Process. Lett.
1978, volume: 7, number: 1

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