Journals in DBLP
C. A. R. Hoare , Jifeng He , Jeff W. Sanders Prespecification in Data Refinement. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:71-76 [Journal ] Jyrki Katajainen , Olli Nevalainen , Jukka Teuhola A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:77-86 [Journal ] Mikhail J. Atallah , Chandrajit L. Bajaj Efficient Algorithms for Common Transversals. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:87-91 [Journal ] Manfred Broy Predicative Specifications for Functional Programs Describing Communication Networks. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:93-101 [Journal ] K. B. Lakshmanan , N. Meenakshi , Krishnaiyan Thulasiraman A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:103-109 [Journal ] Alan M. Frieze Parallel Algorithms for Finding Hamilton Cycles in Random Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:111-117 [Journal ] F. Miller Maley An Observation Concerning Constraint-Based Compaction. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:119-122 [Journal ] Victor J. Rayward-Smith The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:123-125 [Journal ] Ravi B. Boppana , Johan Håstad , Stathis Zachos Does co-NP Have Short Interactive Proofs? [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:127-132 [Journal ] Robert D. Tennent Quantification in Algol-Like Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:133-137 [Journal ] Grigori Mints , Enn Tyugu Corrigendum: Semantics of a Declarative Language. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:2, pp:139- [Journal ]