Journals in DBLP
Jörg Keller A heuristic to accelerate in-situ permutation algorithms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:119-125 [Journal ] Fredrik Jönsson , Thomas Johansson A fast correlation attack on LILI-128. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:127-132 [Journal ] Qi Cheng , Fang Fang Kolmogorov random graphs only have trivial stable colorings. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:133-136 [Journal ] Joachim Gudmundsson , Thore Husfeldt , Christos Levcopoulos Lower bounds for approximate polygon decomposition and minimum gap. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:137-141 [Journal ] Oh-Heum Kwon , Kyung-Yong Chwa Approximation algorithms for general parallel task scheduling. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:143-150 [Journal ] Lusheng Wang , Zimao Li An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:151-156 [Journal ] Hoàng-Oanh Le , Van Bang Le The NP-completeness of (1, r)-subcolorability of cubic graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:157-162 [Journal ] Marco Cesati Perfect Code is W[1]-complete. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:163-168 [Journal ] Gordon Lyon Comparison of two code scalability tests. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:3, pp:169-174 [Journal ]