|
|
Journals in DBLP
- Kuo-Liang Chung
A Fast Algorithm for Stereo Matching. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:63, n:2, pp:57-61 [Journal]
- Refael Hassin, Shlomi Rubinstein
An Approximation Algorithm for Maximum Packing of 3-Edge Paths. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:63, n:2, pp:63-67 [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:69-73 [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:75-78 [Journal]
- Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold
A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:63, n:2, pp:79-83 [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:85-90 [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:91-95 [Journal]
- Tiziana Calamoneri, Andrea Sterbini
3D Straight-Line Grid Drawing of 4-Colorable Graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:63, n:2, pp:97-102 [Journal]
- Jan-Ming Ho, Ming-Tat Ko
Bounded Fan-Out m-Center Problem. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:63, n:2, pp:103-108 [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:109-112 [Journal]
- Robert Geist
Performance Bounds for Modeling NUMA Architectures. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:63, n:2, pp:113-117 [Journal]
|
