Journals in DBLP

Inf. Process. Lett.
1988, volume: 28, number: 4

1. Colm Ó'Dúnlaing
   A Tight Lower Bound for the Complexity of Path-Planning for a Disc. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:165-170 [Journal]
   
2. Makoto Imase, Yoshifumi Manabe
   Fault-Tolerant Routings in a kappa-Connected Network. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:171-175 [Journal]
   
3. Moon-Jung Chung, Mukkai S. Krishnamoorthy
   Algorithms of Placing Recovery Points. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:177-181 [Journal]
   
4. Jianzhong Du, Joseph Y.-T. Leung
   Scheduling Tree-Structured Tasks with Restricted Execution Times. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:183-188 [Journal]
   
5. Daniel J. Rosenkrantz, Harry B. Hunt III
   Matrix Multiplication for Finite Algebraic Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:189-192 [Journal]
   
6. Yuji Takada
   Grammatical Interface for Even Linear Languages Based on Control Sets. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:193-199 [Journal]
   
7. Guan-Ing Chen, Ten-Hwang Lai
   Preemptive Scheduling of Independent Jobs on a Hypercube. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:201-206 [Journal]
   
8. Gilles Brassard, Sampath Kannan
   The Generation of Random Permutations on the Fly. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:207-212 [Journal]
   
9. Ichiro Suzuki
   Proving Properties of a Ring of Finite-State Machines. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:28, n:4, pp:213-214 [Journal]
   
10. Katsushi Inoue, Itsuo Takanami
    Some Considerations About NPRIORITY(1) Without ROM. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:4, pp:215-219 [Journal]