Journals in DBLP

Inf. Process. Lett.
1981, volume: 12, number: 1

1. S. Mauceri, Antonio Restivo
   A Family of Codes Commutatively Equivalent to Prefix Codes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:1-4 [Journal]
   
2. Krzysztof Dudzinski, Andrzej Dydek
   On a Stable Minimum Storage Merging Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:5-8 [Journal]
   
3. Eugene L. Lawler, Charles U. Martel
   Scheduling Periodically Occurring Tasks on Multiple Processors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:9-12 [Journal]
   
4. Christian Choffrut
   A Closure Property of Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:13-16 [Journal]
   
5. Nai-Kuan Tsao
   The Numerical Instability of Bini's Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:17-19 [Journal]
   
6. Harold N. Gabow
   A Linear-Time Recognition Algorithm for Interval Dags. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:20-22 [Journal]
   
7. Dorothy E. Denning, Fred B. Schneider
   Master Keys for Group Sharing. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:23-25 [Journal]
   
8. Eric C. R. Hehner
   Bunch Theory: A Simple Set Theory for Computer Science. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:26-30 [Journal]
   
9. Sue Whitesides
   An Algorithm for Finding Clique Cut-Sets. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:1, pp:31-32 [Journal]
   
10. Pavol Hell, David G. Kirkpatrick
    On Generalized Matching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:33-35 [Journal]
    
11. Maurice Bruynooghe
    Solving Combinatorial Search Problems by Intelligent Backtracking. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:36-39 [Journal]
    
12. Errol L. Lloyd
    Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:40-45 [Journal]
    
13. Stefano Ceri, Giuseppe Pelagatti
    An Upper Bound on the Number of Execution Nodes for a Distributed Join. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:46-48 [Journal]
    
14. Mark H. Overmars, Jan van Leeuwen
    Some Principles for Dynamizing Decomposable Searching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:49-53 [Journal]
    
15. Leslie G. Valiant
    Addendum: Computing Multivariate Polynomials in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:54- [Journal]