Journals in DBLP

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

1. François Denis
   Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:1, pp:1-5 [Journal]
   
2. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
   Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:1, pp:7-13 [Journal]
   
3. Jitender S. Deogun, K. Gopalakrishnan
   Consecutive Retrieval Property-Revisited. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:1, pp:15-20 [Journal]
   
4. Soo Hak Sung, Seongtaek Chee, Choonsik Park
   Global Avalanche Characteristics and Propagation Criterion of Balanced Boolean Functions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:1, pp:21-24 [Journal]
   
5. Tycho Strijk, Marc J. van Kreveld
   Labeling a Rectilinear Map More Efficiently. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:1, pp:25-30 [Journal]
   
6. Jichiang Tsai, Yi-Min Wang, Sy-Yen Kuo
   Evaluations of Domino-Free Communication-Induced Checkpointing Protocols. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:1, pp:31-37 [Journal]
   
7. Jae-Ha Lee, Kyung-Yong Chwa
   Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:1, pp:39-45 [Journal]
   
8. Paul Kruszewski
   A Note on the Horton-Strahler Number for Random Binary Search Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:1, pp:47-51 [Journal]