Journals in DBLP

Inf. Process. Lett.
1984, volume: 19, number: 5

1. Juhani Karhumäki, Derick Wood
   Inverse Morphic Equivalence on Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:213-218 [Journal]
   
2. Greg N. Frederickson
   On Linear-Time Algorithms for Five-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:219-224 [Journal]
   
3. Erkki Mäkinen
   On Derivation Preservation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:225-228 [Journal]
   
4. Derick Wood
   The Contour Problem for Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:229-236 [Journal]
   
5. Paul Bourret
   How to Estimate the Sizes of Domains. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:237-243 [Journal]
   
6. George Tourlakis
   An Inductive Number-Theoretic Characterization of NP. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:245-247 [Journal]
   
7. Jozef Vyskoc
   A Note on Boolean Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:249-251 [Journal]
   
8. Pierre McKenzie
   Permutations of Bounded Degree Generate Groups of Polynomial Diameter. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:253-254 [Journal]
   
9. Goker Gursel, Peter Scheuermann
   Asserting the Optimality of Serial SJRPs in Processing Simple Queries in Chain Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:19, n:5, pp:255-260 [Journal]