Journals in DBLP

Inf. Process. Lett.
1999, volume: 69, number: 2

1. Guo-Hui Lin, Guoliang Xue
   Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:53-57 [Journal]
   
2. Henning Bordihn, Markus Holzer
   On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:59-62 [Journal]
   
3. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
   An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:63-67 [Journal]
   
4. Ju-Hong Lee, Guang-Ho Cha, Chin-Wan Chung
   A Model for k-Nearest Neighbor Query Processing Cost in Multidimensional Data Space. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:69-76 [Journal]
   
5. S. R. Chauhan, Iain A. Stewart
   On the Power of Built-In Relations in Certain Classes of Program Schemes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:77-82 [Journal]
   
6. Marius Zimand
   Relative to a Random Oracle, P/Poly is not Measurable in EXP. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:83-86 [Journal]
   
7. Chin-Wen Ho, Jou-Ming Chang
   Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:87-93 [Journal]
   
8. Chih-Hung Wang, Tzonelih Hwang, Narn-Yih Lee
   Comments on Two Group Signatures. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:95-97 [Journal]
   
9. Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. Levitin, Dimiter R. Avresky
   On the Covering of Vertices for Fault Diagnosis in Hypercubes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:2, pp:99-103 [Journal]