Journals in DBLP

Inf. Process. Lett.
1992, volume: 42, number: 5

1. Khaled Day, Anand R. Tripathi
   Arrangement Graphs: A Class of Generalized Star Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:235-241 [Journal]
   
2. Zhi-Zhong Chen
   A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:243-248 [Journal]
   
3. Andrew V. Goldberg
   A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:249-256 [Journal]
   
4. Stephen K. Wismath
   Computing the Full Visibility Graph of a Set of Line Segments. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:257-261 [Journal]
   
5. Jiawei Han
   Binding Propagation Beyond the Reach of Rule/Goal Graphs. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:263-268 [Journal]
   
6. Bruce E. Litow
   On Iterated Integer Product. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:269-272 [Journal]
   
7. Graham Wrightson, Jo Coldwell
   A Truncation Technique for Clausal Analytic Tableaux. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:271-281 [Journal]
   
8. Suresh Singh
   Expected Connectivity and Leader Election in Unreliable Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:283-285 [Journal]
   
9. Helen Cameron, Derick Wood
   A Note on the Path Length of Red-Black Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:42, n:5, pp:287-292 [Journal]