Journals in DBLP

Inf. Process. Lett.
1981, volume: 12, number: 3

1. Bruno Courcelle
   The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA's. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:111-114 [Journal]
   
2. Gary L. Peterson
   Myths About the Mutual Exclusion Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:115-116 [Journal]
   
3. Will E. Leland, Raphael A. Finkel, Li Qiao, Marvin H. Solomon, Leonard Uhr
   High Density Graphs for Processor Interconnection. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:117-120 [Journal]
   
4. Ronald V. Book
   The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:121-122 [Journal]
   
5. Gerhard Lischke
   Two Types of Properties for Complexity Measures. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:123-126 [Journal]
   
6. Reinhard Wilhelm
   A Modified Tree-to-Tree Correction Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:127-132 [Journal]
   
7. Robert J. Fowler, Mike Paterson, Steven L. Tanimoto
   Optimal Packing and Covering in the Plane are NP-Complete. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:133-137 [Journal]
   
8. Jerzy W. Jaromczyk
   Linear Decision Trees are too Weak for Convex Hull Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:138-141 [Journal]
   
9. Alberto Bertoni, Giancarlo Mauri
   On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:3, pp:142-145 [Journal]
   
10. W. Erni, R. Lapsien
    On the Time and Tape Complexity of Weak Unification. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:3, pp:146-150 [Journal]
    
11. Paolo Ancilotti, Maurelio Boari
    Information Streams Sharing a Finite Buffer: Protection Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:3, pp:151-159 [Journal]