Journals in DBLP

Inf. Process. Lett.
2002, volume: 81, number: 1

1. Michael Krivelevich
   Deciding k-colorability in expected polynomial time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:1-6 [Journal]
   
2. Vadim V. Lozin
   On maximum induced matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:7-11 [Journal]
   
3. Kuo-Liang Chung, Wen-Ming Yan
   Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:13-21 [Journal]
   
4. Yaoyun Shi
   Entropy lower bounds for quantum decision tree complexity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:23-27 [Journal]
   
5. Jerzy Skurczynski
   A characterization of Büchi tree automata. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:29-33 [Journal]
   
6. Arturo Carpi, Aldo de Luca
   A combinatorial property of the factor poset of a word. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:35-39 [Journal]
   
7. Chien-Lung Hsu, Tzong-Sun Wu, Tzong-Chen Wu
   Improvements of generalization of threshold signature and authenticated encryption for group communications. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:41-45 [Journal]
   
8. Michael J. Spriggs, J. Mark Keil
   A new bound for map labeling with uniform circle pairs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:47-53 [Journal]
   
9. Alain Bretto, Stéphane Ubéda, Janez Zerovnik
   A polynomial algorithm for the strong Helly property. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:1, pp:55-57 [Journal]