
Journals in DBLP
 Michael Krivelevich
Deciding kcolorability in expected polynomial time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:1, pp:16 [Journal]
 Vadim V. Lozin
On maximum induced matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:1, pp:711 [Journal]
 KuoLiang Chung, WenMing 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:1321 [Journal]
 Yaoyun Shi
Entropy lower bounds for quantum decision tree complexity. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:1, pp:2327 [Journal]
 Jerzy Skurczynski
A characterization of Büchi tree automata. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:1, pp:2933 [Journal]
 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:3539 [Journal]
 ChienLung Hsu, TzongSun Wu, TzongChen 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:4145 [Journal]
 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:4753 [Journal]
 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:5557 [Journal]
