Journals in DBLP

Inf. Process. Lett.
1985, volume: 20, number: 4

1. Emo Welzl
   Constructing the Visibility Graph for n-Line Segments in O(n²) Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:167-171 [Journal]
   
2. Mathai Joseph
   On a Problem in Real-Time Computing. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:173-177 [Journal]
   
3. Nicola Santoro, Jeffrey B. Sidney
   Interpolation-Binary Search. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:179-181 [Journal]
   
4. K. Rangarajan, S. Arun-Kumar
   Fair Derivations in E0L Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:183-188 [Journal]
   
5. Carroll Morgan
   Global and Logical Time in Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:189-194 [Journal]
   
6. David S. Wise
   Representing Matrices as Quadtrees for Parallel Processors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:195-199 [Journal]
   
7. J. Mark Keil
   Finding Hamiltonian Circuits in Interval Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:201-206 [Journal]
   
8. W. J. Van Gils
   How to Cope with Faulty Processors in a Completely Connected Network of Communicating Processors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:207-213 [Journal]
   
9. Costas S. Iliopoulos
   Analysis of Algorithms on Problems in General Abelian Groups. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:20, n:4, pp:215-220 [Journal]