Journals in DBLP

Inf. Process. Lett.
1999, volume: 71, number: 2

1. T. C. Edwin Cheng, Guoqing Wang
   Two-Machine Flowshop Scheduling with Consecutive Availability Constraints. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:71, n:2, pp:49-54 [Journal]
   
2. Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert
   Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:71, n:2, pp:55-61 [Journal]
   
3. Tomoyuki Yamakami, Andrew Chi-Chih Yao
   NQP_C = co-C₌P. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:71, n:2, pp:63-69 [Journal]
   
4. Limin Xiang, Kazuo Ushijima
   A Theorem on the Relation Between BSR_k and BSR⁺. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:71, n:2, pp:71-73 [Journal]
   
5. Chu Min Li
   A Constraint-Based Approach to Narrow Search Trees for Satisfiability. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:71, n:2, pp:75-80 [Journal]
   
6. Stefan Dobrev, Imrich Vrto
   Optimal Broadcasting in Hypercubes with Dynamic Faults. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:71, n:2, pp:81-85 [Journal]
   
7. Sandi Klavzar, Jack H. Koolen, Henry Martyn Mulder
   Graphs which Locally Mirror the Hypercube Structure. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:71, n:2, pp:87-90 [Journal]
   
8. Yen-Chun Lin, Ching-Sung Yeh
   Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:71, n:2, pp:91-95 [Journal]