Journals in DBLP

Inf. Process. Lett.
1998, volume: 65, number: 4

1. Kim S. Larsen
   Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:169-172 [Journal]
   
2. Jerzy R. Nawrocki, Adam Czajka, Wojciech Complak
   Scheduling Cyclic Tasks with Binary Periods. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:173-178 [Journal]
   
3. Sundarajan Vedantham, S. Sitharama Iyengar
   The Bandwidth Allocation Problem in the ATM Network Model is NP-Complete. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:179-182 [Journal]
   
4. Stavros D. Nikolopoulos, Panos Rondogiannis
   On the Number of Spanning Trees of Multi-Star Related Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:183-188 [Journal]
   
5. Tzonelih Hwang, Chih-Hung Wang
   Arbetrated Unconditionally Secure Authentication Scheme with Multi-Senders. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:189-193 [Journal]
   
6. Luc Devroye
   On the Richness of the Collection of Subtrees in Random Binary Search Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:195-199 [Journal]
   
7. Chung Keung Poon, Binhai Zhu, Francis Y. L. Chin
   A Polynomial Time Solution for Labeling a Rectlinear Map. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:201-207 [Journal]
   
8. Oded Shmueli, Kurt A. Shoens
   Data Sufficiency for Queries on Cache. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:209-216 [Journal]
   
9. Nader H. Bshouty, Christino Tamon, David K. Wilson
   On Learning width Two Branching Programs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:4, pp:217-222 [Journal]