Journals in DBLP

Inf. Process. Lett.
1991, volume: 40, number: 6

1. Miklós Bartha, Éva Gombás
   A Structure Theorem for Maximum Internal Matchings in Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:289-294 [Journal]
   
2. Chang-Biau Yang
   Reducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:295-302 [Journal]
   
3. Ferruccio Barsi
   Mod m Arithmetic in Binary Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:303-309 [Journal]
   
4. Akhil Kumar, Shun Yan Cheung
   A High Availability \sqrt{N} Hierarchical Grid Algorithm for Replicated Data. [Citation Graph (3, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:311-316 [Journal]
   
5. Lloyd Allison, Trevor I. Dix, Chut N. Yee
   Shortest Path and Closure Algorithms for Banded Matrices. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:317-322 [Journal]
   
6. Xiaojun Shen, Edward M. Reingold
   Scheduling on a Hypercube. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:323-328 [Journal]
   
7. Pai-Cheng Chu
   Evaluating Clustering Factor Approach to Estimating Block Selectivities. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:329-334 [Journal]
   
8. Subrata Ghosh, Ambuj Mahanti
   Bidirectional Heuristic Search with Limited Resources. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:335-340 [Journal]
   
9. Fikret Erçal
   Distributed Evaluation of an Iterative Function for all Object Pairs on an SIMD Hybercube. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:6, pp:341-345 [Journal]