
Journals in DBLP
 Juhani Karhumäki, Derick Wood
Inverse Morphic Equivalence on Languages. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1984, v:19, n:5, pp:213218 [Journal]
 Greg N. Frederickson
On LinearTime Algorithms for FiveColoring Planar Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1984, v:19, n:5, pp:219224 [Journal]
 Erkki Mäkinen
On Derivation Preservation. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1984, v:19, n:5, pp:225228 [Journal]
 Derick Wood
The Contour Problem for Rectilinear Polygons. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1984, v:19, n:5, pp:229236 [Journal]
 Paul Bourret
How to Estimate the Sizes of Domains. [Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1984, v:19, n:5, pp:237243 [Journal]
 George Tourlakis
An Inductive NumberTheoretic Characterization of NP. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1984, v:19, n:5, pp:245247 [Journal]
 Jozef Vyskoc
A Note on Boolean Matrix Multiplication. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1984, v:19, n:5, pp:249251 [Journal]
 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:253254 [Journal]
 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:255260 [Journal]
