Journals in DBLP

Inf. Process. Lett.
1994, volume: 50, number: 5

1. Giovanni Manzini
   Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:50, n:5, pp:231-238 [Journal]
   
2. Dennis Moore, William F. Smyth
   An Optimal Algorithm to Compute all the Covers of a String. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:50, n:5, pp:239-246 [Journal]
   
3. Mitchell L. Neilsen, Masaaki Mizuno
   Nondominated k-Coteries for Multiple Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:50, n:5, pp:247-252 [Journal]
   
4. Huade Li
   Trajectory Planning in H-Space. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:50, n:5, pp:253-258 [Journal]
   
5. Xubo Zhang, Z. Meral Özsoyoglu
   Some Results on the Containment and Minimization of (in) Equality Queries. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1994, v:50, n:5, pp:259-267 [Journal]
   
6. Chris H. Perleberg
   Single Character Searching Methods and the shift-or Pattern-Matching Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:50, n:5, pp:269-275 [Journal]
   
7. Shuji Jimbo, Akira Maruoka
   On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:50, n:5, pp:277-282 [Journal]
   
8. Abraham P. Punnen, Kunhiraman Nair
   A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:50, n:5, pp:283-286 [Journal]