Journals in DBLP

Inf. Process. Lett.
1980, volume: 11, number: 4/5

1. Alfred Laut
   Safe Procedural Implementations of Algebraic Types. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:147-151 [Journal]
   
2. Jan Paredaens, F. Ponsaert
   Grant Levels in an Authorization Mechanism. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:152-155 [Journal]
   
3. Greg N. Frederickson
   Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:156-161 [Journal]
   
4. Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier
   A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:162- [Journal]
   
5. David R. Hanson
   Code Improvement Via Lazy Evaluation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:163-167 [Journal]
   
6. J. H. ter Bekke
   Convertibility in Databases. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:168-171 [Journal]
   
7. Alberto Pettorossi
   Derivation of an O(k² log n) Algorithm for Computing Order-k Fibonacci Numbers From the O(k³ log n) Matrix Multiplication Method. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:172-179 [Journal]
   
8. M. Howard Williams
   Cubic Map Configurations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:180-185 [Journal]
   
9. M. Howard Williams
   Batch Sizes for the Batching Method of Colouring Planar Maps. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:11, n:4/5, pp:186-189 [Journal]
   
10. Mila E. Majster-Cederbaum
    A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:190-192 [Journal]
    
11. Rossella Petreschi, Bruno Simeone
    A Switching Algorithm for the Solution of Quadratic Boolean Equations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:193-198 [Journal]
    
12. R. K. Arora, S. P. Rana
    Heuristic Algorithms for Process Assignment in Distributed Computing Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:199-203 [Journal]
    
13. Hiroya Kawai
    A Formal System for Parallel Programs in Discrete Time and Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:204-210 [Journal]
    
14. J. ten Hoopen
    Consecutive Retrieval with Redundancy: An Optimal Linear and an Optimal Cyclic Arrangement and Their Storage Space Requirements. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:211-217 [Journal]
    
15. Peter Kandzia, Margret Mangelmann
    On Covering Boyce-Codd Normal Forms. [Citation Graph (3, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:218-223 [Journal]
    
16. Seppo Pajunen
    On Two Theorems of Lenstra. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:224-228 [Journal]
    
17. Alfons J. Jammel, Helmut G. Stiegler
    On Expected Costs of Deadlock Detection. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:229-231 [Journal]