Journals in DBLP

Inf. Process. Lett.
1980, volume: 11, number: 1

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