|
Journals in DBLP
- Andrew Turpin, Alistair Moffat
Comment on ``Efficient Huffman Decoding'' and ``An Efficient Finite-State Machine Implementation of Huffman Decoders''. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:1-2 [Journal]
- Alfredo García Olaverri, Pedro Jodrá, Javier Tejel
An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:3-9 [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:11-15 [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:17-23 [Journal]
- Chan-Su Shin, Sung Yong Shin, Kyung-Yong Chwa
The Widest k-Dense Corridor Problems. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:25-31 [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:33-38 [Journal]
- Chi-Hsiang 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:39-45 [Journal]
- Wojciech Fraczak, Marek B. Zaremba
A Non-SOS Operational Semantics for a Process Algebra. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:1, pp:47-54 [Journal]
|