Journals in DBLP
Luis Fariñas del Cerro A Simple Deduction Method for Modal Logic. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:49-51 [Journal ] A. O. Slisenko Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:52-56 [Journal ] Marc H. Graham , Alberto O. Mendelzon Strong Equivalence of Relational Wxpressions Under Dependencies. [Citation Graph (4, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:57-62 [Journal ] J. C. Lagarias , D. E. Swartwout Minimal Storage Representations for Binary Relations. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:63-66 [Journal ] Giuseppina C. Gini The Automatic Synthesis of Iterative Programs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:67-73 [Journal ] Herbert Edelsbrunner , Hermann A. Maurer , David G. Kirkpatrick Polygonal Intersection Searching. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:74-79 [Journal ] Jan A. Bergstra , John-Jules Ch. Meyer A Simple Transfer Lemma for Algebraic Specifications. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:80-85 [Journal ] Eli Upfal Formal Correctness Proofs of a Nondeterministic Program. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:86-92 [Journal ] Ludek Kucera Parallel Computation and Conflicts in Memory Access. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:93-96 [Journal ]