Journals in DBLP

Inf. Process. Lett.
1987, volume: 26, number: 1

1. Brigitte Jaumard, Bruno Simeone
   On the Complexity of the Maximum Satisfiability Problem for Horn Formulas. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:1-4 [Journal]
   
2. James R. Driscoll, Sheau-Dong Lang, LeRoy A. Franklin
   Modeling B-Tree Insertion Activity. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:5-18 [Journal]
   
3. Alfs T. Berztiss
   A Notation for Distributed Operations. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:19-21 [Journal]
   
4. Jean Berstel, Srecko Brlek
   On the Length of Word Chains. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:23-28 [Journal]
   
5. Ronald V. Book, Hai-Ning Liu
   Rewriting Systems and Word Problems in a Free Partially Commutative Monoid. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:29-32 [Journal]
   
6. Svante Carlsson
   The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:33-36 [Journal]
   
7. Janet Incerpi, Robert Sedgewick
   Practical Variations of Shellsort. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:37-43 [Journal]
   
8. Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie
   Equivalence of Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:45-50 [Journal]
   
9. László Babai
   Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:26, n:1, pp:51-53 [Journal]