Journals in DBLP

Inf. Process. Lett.
2007, volume: 104, number: 5

1. K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachariasen
   Bounding component sizes of two-connected Steiner networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:5, pp:159-163 [Journal]
   
2. Petr Jancar, Zdenek Sawa
   A note on emptiness for alternating finite automata with a one-letter alphabet. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:5, pp:164-167 [Journal]
   
3. Rahul Roy, Amitava Bagchi
   On estimating the time taken to rectify faults in a software package during the system testing phase. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:5, pp:168-172 [Journal]
   
4. Hiroshi Nagamochi, Kohei Okada
   Approximating the minmax rooted-tree cover in a tree. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:5, pp:173-178 [Journal]
   
5. Hossein Ghodosi
   On insecurity of Naor-Pinkas' distributed oblivious transfer. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:5, pp:179-182 [Journal]
   
6. Jaechul Sung, Deukjo Hong, Seokhie Hong
   Cryptanalysis of an involutional block cipher using cellular automata. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:5, pp:183-185 [Journal]
   
7. Michael Elkin, Christian Liebchen, Romeo Rizzi
   New length bounds for cycle bases. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:5, pp:186-193 [Journal]