Journals in DBLP

Inf. Process. Lett.
1996, volume: 58, number: 3

1. Viggo Kann, Jens Lagergren, Alessandro Panconesi
   Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:58, n:3, pp:105-110 [Journal]
   
2. B. S. Panda
   New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:58, n:3, pp:111-115 [Journal]
   
3. Koji Obokata, Yasuaki Nishitani, Yoshihide Igarashi
   A Probably Optimal Embedding of Hyper-Rings in Hypercubes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:58, n:3, pp:117-122 [Journal]
   
4. Sang-Koo Seo, Yoon-Joon Lee
   Applicability of Genetic Algorithms to Optimal Evaluation of Path Predicates in Object-Oriented Queries. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:58, n:3, pp:123-128 [Journal]
   
5. Tomio Hirata
   A Unified Linear-Time Algorithm for Computing Distance Maps. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:58, n:3, pp:129-133 [Journal]
   
6. Amnon Ta-Shma
   A Note on PCP vs. MIP. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:58, n:3, pp:135-140 [Journal]
   
7. Twan Basten
   Branching Bisimilarity is an Equivalence Indeed! [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:58, n:3, pp:141-147 [Journal]
   
8. Weifa Liang, Brendan D. McKay, Hong Shen
   NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:58, n:3, pp:149-155 [Journal]