Journals in DBLP

Inf. Process. Lett.
2007, volume: 103, number: 2

1. Brendan Lucier, Tao Jiang, Ming Li
   Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:2, pp:45-51 [Journal]
   
2. Wei-Wei Wang, Meijie Ma, Jun-Ming Xu
   Fault-tolerant pancyclicity of augmented cubes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:2, pp:52-56 [Journal]
   
3. Kofi A. Laing
   Name-independent compact routing in trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:2, pp:57-60 [Journal]
   
4. Nina Amenta, Matthew Godwin, Nicolay Postarnakevich, Katherine St. John
   Approximating geodesic tree distance. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:2, pp:61-65 [Journal]
   
5. Mikhail Ju. Moshkov
   On algorithms for construction of all irreducible partial covers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:2, pp:66-70 [Journal]
   
6. Ryuhei Uehara, Gabriel Valiente
   Linear structure of bipartite permutation graphs and the longest path problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:2, pp:71-77 [Journal]
   
7. Wen An Liu, Kun Meng, Shu Min Xing
   Q-ary search with one lie and bi-interval queries. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:2, pp:78-81 [Journal]