Journals in DBLP

Inf. Process. Lett.
2004, volume: 92, number: 1

1. Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda
   Searching a polygonal region by a group of stationary k-searchers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:1, pp:1-8 [Journal]
   
2. Gabriel Valiente
   Trading uninitialized space for time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:1, pp:9-13 [Journal]
   
3. Chung-Haw Chang, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
   The super laceability of the hypercubes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:1, pp:15-21 [Journal]
   
4. Ding Liu
   A strong lower bound for approximate nearest neighbor searching. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:1, pp:23-29 [Journal]
   
5. Xiaofan Yang, David J. Evans, Hong-Jian Lai, Graham M. Megson
   Generalized honeycomb torus is Hamiltonian. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:1, pp:31-37 [Journal]
   
6. Bruce E. Litow, Narsingh Deo
   Graph compression and the zeros of polynomials. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:1, pp:39-44 [Journal]
   
7. Byron L. D. Bezerra, Francisco de A. T. de Carvalho
   A symbolic approach for content-based information filtering. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:1, pp:45-52 [Journal]
   
8. Sharon A. Curtis
   Darts and hoopla board design. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:1, pp:53-56 [Journal]