Journals in DBLP

Inf. Process. Lett.
1991, volume: 40, number: 1

1. Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri
   A Note on the Approximation of the MAX CLIQUE Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:1-5 [Journal]
   
2. Reinhold Heckmann
   Lower and Upper Power Domain Constructions Commute on all Cpos. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:7-11 [Journal]
   
3. Nen-Fu Huang, Ching-Ho Huang
   Complexity of the Repeaters Allocating Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:13-20 [Journal]
   
4. Volker Diekert, Ronald V. Book
   On ``Inherently Context-Sensitive'' Languages - An Application of Complexity Cores. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:21-23 [Journal]
   
5. Tao Jiang, Bala Ravikumar
   A Note on the Space Complexity of Some Decision Problems for Finite Automata. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:25-31 [Journal]
   
6. Maria Cristina Pinotti, Geppino Pucci
   Parallel Priority Queues. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:33-40 [Journal]
   
7. Thomas C. Shermer
   A Counterexample to the Algorithms for Determining Opaque Minimal Forests. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:41-42 [Journal]
   
8. Jean R. S. Blair, Errol L. Lloyd
   The Benefits of External Wires in Single Row Routing. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:43-49 [Journal]
   
9. Wim H. Hesselink
   Repetitions, Known or Unknown? [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:40, n:1, pp:51-57 [Journal]