Journals in DBLP

Inf. Process. Lett.
1988, volume: 27, number: 4

1. Yung H. Tsin
   On Handling Vertex Deletion in Updating Spanning Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:167-168 [Journal]
   
2. K. V. S. Ramarao, Robert Daley, Rami G. Melhem
   Message Complexity of the Set Intersection Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:169-174 [Journal]
   
3. Hans Rohnert
   Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:175-179 [Journal]
   
4. Richard Koo, Sam Toueg
   Effects of Message Loss on the Termination of Distributed Protocols. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:181-188 [Journal]
   
5. Ulrich Faigle, Rainer Schrader
   On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:189-194 [Journal]
   
6. Abdol-Hossein Esfahanian, S. Louis Hakimi
   On Computing a Conditional Edge-Connectivity of a Graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:195-199 [Journal]
   
7. Andrzej Szepietowski
   Remarks on Languages Acceptable in log n Space. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:201-203 [Journal]
   
8. Dominique Roelants van Baronaigien, Frank Ruskey
   Generating t-ary Trees in A-Order. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:205-213 [Journal]
   
9. Khaled M. Bugrara, Paul Walton Purdom Jr.
   An Exponential Lower Bound for the Pure Literal Rule. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:4, pp:215-219 [Journal]