Journals in DBLP

Inf. Process. Lett.
1996, volume: 60, number: 5

1. Janka Chlebíková
   Approximating the Maximally Balanced Connected Partition Problem in Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:223-230 [Journal]
   
2. David B. Skillicorn
   A Parallel Tree Difference Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:231-235 [Journal]
   
3. Yong Sun
   Term Rewriting and Hoare Logic- Coded Rewriting. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:237-242 [Journal]
   
4. Sven Venema, Hong Shen, Francis Suraweera
   NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Path. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:243-248 [Journal]
   
5. G. Venkatesan, C. Pandu Rangan
   Approximate Triclique Coloring for Register Allocation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:249-253 [Journal]
   
6. Nayla Nassif, Nader Bagherzadeh
   A Grid Embedding into the Star Graph for Image Analysis Solutions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:255-260 [Journal]
   
7. Jinn-ke Jan, Yuh-Min Tseng
   On the Security of Image Encryption Method. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:261-265 [Journal]
   
8. Masayuki Ito, Naofumi Takagi, Shuzo Yajima
   Square Rooting by Iterative Multiply-Additions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:267-269 [Journal]
   
9. Amr M. Youssef, Stafford E. Tavares
   Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion". [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:60, n:5, pp:271-275 [Journal]
   
10. Josep Domingo-Ferrer
    A New Privacy Homomorphism and Applications. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:5, pp:277-282 [Journal]