
Journals in DBLP
 KuoLiang Chung
A Fast Algorithm for Stereo Matching. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:5761 [Journal]
 Refael Hassin, Shlomi Rubinstein
An Approximation Algorithm for Maximum Packing of 3Edge Paths. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:6367 [Journal]
 J. G. Gaines
Partitions with Minimum Entropy of Regions in R². [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:6973 [Journal]
 Gudmund Skovbjerg Frandsen, Sven Skyum
Dynamic Maintenance of Majority Information in Constant Time per Update. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:7578 [Journal]
 Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold
A Better Lower Bound on the Competitive Ratio of the Randomized 2Server Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:7983 [Journal]
 Costas Busch, Marios Mavronicolas
Impossibility Results for Weak Threshold Networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:8590 [Journal]
 Wilfried Imrich, Sandi Klavzar
Recognizing Hamming Graphs in Linear Time and space. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:9195 [Journal]
 Tiziana Calamoneri, Andrea Sterbini
3D StraightLine Grid Drawing of 4Colorable Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:97102 [Journal]
 JanMing Ho, MingTat Ko
Bounded FanOut mCenter Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:103108 [Journal]
 Yehuda Afek, Menashe Cohen, Eyal Haalman
The Bit Complexity of the Predecessor Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:109112 [Journal]
 Robert Geist
Performance Bounds for Modeling NUMA Architectures. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:113117 [Journal]
