Journals in DBLP

Inf. Process. Lett.
2005, volume: 93, number: 5

1. Sandeep S. Kulkarni, Chase Bolen, John Oleszkiewicz, Andrew Robinson
   Alternators in read/write atomicity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:5, pp:207-215 [Journal]
   
2. Mohammad Reza Mousavi, Michel A. Reniers, Jan Friso Groote
   A syntactic commutativity format for SOS. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:5, pp:217-223 [Journal]
   
3. Franck Leprévost, Jean Monnerat, Sébastien Varrette, Serge Vaudenay
   Generating anomalous elliptic curves. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:5, pp:225-230 [Journal]
   
4. Hiroshi Nagamochi
   On computing minimum (s, t)-cuts in digraphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:5, pp:231-237 [Journal]
   
5. Frédéric Chataigner
   Approximating the Maximum Agreement Forest on k trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:5, pp:239-244 [Journal]
   
6. Min Xu, Jun-Ming Xu, Xin-Min Hou
   Fault diameter of Cartesian product graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:5, pp:245-248 [Journal]
   
7. I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao
   A fast algorithm for computing a longest common increasing subsequence. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:5, pp:249-253 [Journal]
   
8. X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, L. M. Wang
   An improved GA and a novel PSO-GA-based hybrid algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:5, pp:255-261 [Journal]