Journals in DBLP

Inf. Process. Lett.
1988, volume: 26, number: 6

1. Ganesh Gopalakrishnan, Mandayam K. Srivas
   Implementing Functional Programs Using Mutable Abstract Data Types. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:277-286 [Journal]
   
2. Tat-hung Chan
   The Boundedness Problem for Three-Dimensional Vector Addition Systems with States. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:287-289 [Journal]
   
3. Bruce M. Maggs, Serge A. Plotkin
   Minimum-Cost Spanning Tree as a Path-Finding Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:291-293 [Journal]
   
4. Richard J. Cole
   An Optimally Efficient Selection Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:295-299 [Journal]
   
5. Israel Cidon
   Yet Another Distributed Depth-First-Search Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:301-305 [Journal]
   
6. Rolf G. Karlsson, Mark H. Overmars
   Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:307-312 [Journal]
   
7. Ludwik Czaja
   Cause-Effect Structures. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:313-319 [Journal]
   
8. Marc Bezem, Jan van Leeuwen
   On Estimating the Complexity of Logarithmic Decompositions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:321-324 [Journal]
   
9. John R. Gilbert
   Some Nested Dissection Order is Nearly Optimal. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:6, pp:325-328 [Journal]