Journals in DBLP

Inf. Process. Lett.
1989, volume: 32, number: 1

1. Peter Damaschke
   The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:1-2 [Journal]
   
2. Dilip Sarkar, Ivan Stojmenovic
   An Optimal Parallel Circle-Cover Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:3-6 [Journal]
   
3. Neil J. Gunther
   Path Integral Methods for Computer Performance Analysis. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:7-13 [Journal]
   
4. Jirí Matousek
   On-Line Computation of Convolutions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:15-16 [Journal]
   
5. A. Prasad Sistla
   On Verifying that a Concurrent Program Satisfies a Nondeterministic Specification. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:17-23 [Journal]
   
6. Kazuo Iwano
   An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:25-27 [Journal]
   
7. Joachim Biskup
   Boyce-Codd Normal Form and Object Normal Forms. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:29-33 [Journal]
   
8. Torben Hagerup
   Hybridsort Revisited and Parallelized. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:35-39 [Journal]
   
9. Andreas Blass, Yuri Gurevich
   On Matijasevitch's Nontraditional Approach to Search Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:1, pp:41-45 [Journal]
   
10. Errol L. Lloyd
    A Fast Algorithm for Finding Interlocking Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:1, pp:47-50 [Journal]