
Journals in DBLP
 Andrew Turpin, Alistair Moffat
Comment on ``Efficient Huffman Decoding'' and ``An Efficient FiniteState Machine Implementation of Huffman Decoders''. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:12 [Journal]
 Alfredo García Olaverri, Pedro Jodrá, Javier Tejel
An Efficient Algorithm for OnLine Searching of Minima in Monge PathDecomposable Tridimensional Arrays. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:39 [Journal]
 Alberto Caprara, Romeo Rizzi
Improving a Family of Approximation Algorithms to Edge Color Multigraphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:1115 [Journal]
 Rajeev Govindan, Michael A. Langston, Xudong Yan
Approximation the Pathwidth of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:1723 [Journal]
 ChanSu Shin, Sung Yong Shin, KyungYong Chwa
The Widest kDense Corridor Problems. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:2531 [Journal]
 Bernd Gärtner, Sven Schönherr
Exact Primitives for Smallest Enclosing Ellipses. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:3338 [Journal]
 ChiHsiang Yeh, Behrooz Parhami
VLSI Layouts of Complete Graphs and Star Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:3945 [Journal]
 Wojciech Fraczak, Marek B. Zaremba
A NonSOS Operational Semantics for a Process Algebra. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:4754 [Journal]
