Journals in DBLP

Inf. Process. Lett.
1989, volume: 33, number: 4

1. Jayaramaiah Boreddy, R. N. Mukherjee
   An Algorithm to Find Polygon Similarity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:105-206 [Journal]
   
2. John Hershberger
   Finding the Upper Envelope of n Line Segments in O(n log n) Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:169-174 [Journal]
   
3. D. T. Lee, Franco P. Preparata
   Parallel Batched Planar Point Location on the CCC. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:175-179 [Journal]
   
4. Torben Hagerup, Christine Rüb
   Optimal Merging and Sorting on the Erew Pram. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:181-185 [Journal]
   
5. Christos Levcopoulos, Ola Petersson
   A Note on Adaptive Parallel Sorting. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:187-191 [Journal]
   
6. Egon Wanke, Manfred Wiegers
   Undecidability of the Bandwidth Problem on Linear Graph Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:193-197 [Journal]
   
7. José D. P. Rolim
   On the Polynomial IO-Complexity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:199-204 [Journal]
   
8. Richard Zippel
   An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:207-212 [Journal]
   
9. Janez Zerovnik
   A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:33, n:4, pp:213-219 [Journal]