Eli Biham How to decrypt or even substitute DES-encrypted messages in 2^{28} steps. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:84, n:3, pp:117-124 [Journal]

Zhi-Zhong Chen, Shiqing Zhang Tight upper bound on the number of edges in a bipartite K_{3, 3}-free or K_{5}-free graph with an application. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:84, n:3, pp:141-145 [Journal]

Hans Kleine Büning, Xishun Zhao Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:84, n:3, pp:147-151 [Journal]

Oded Regev Priority algorithms for makespan minimization in the subset model. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:84, n:3, pp:153-157 [Journal]