Journals in DBLP

Inf. Process. Lett.
1980, volume: 11, number: 3

1. Joseph Y.-T. Leung, M. L. Merrill
   A Note on Preemptive Scheduling of Periodic, Real-Time Tasks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:115-118 [Journal]
   
2. J. M. Robson
   Storage Allocation is NP-Hard. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:119-125 [Journal]
   
3. David Avis
   Comments on a Lower Bound for Convex Hull Determination. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:126- [Journal]
   
4. Arnaldo Moura
   A Note on Grammatical Covers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:127-129 [Journal]
   
5. Thomas A. Bailey, R. Geoff Dromey
   Fast String Searching by Finding Subkeys in Subtext. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:130-133 [Journal]
   
6. Francesco Romani
   Shortest-Path Problem is not Harder Than Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:134-136 [Journal]
   
7. Hannu Erkiö
   Internal Merge Sorting with Delayed Selection. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:137-140 [Journal]
   
8. Nachum Dershowitz
   The Schorr-Waite Marking Algorithm Revisited. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:141-143 [Journal]
   
9. Efim B. Kinber
   On Inclusion Problem for Deterministic Multitape Automata. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:3, pp:144-146 [Journal]