Journals in DBLP

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

1. Vadim E. Kotov
   Andrei P. Ershov (1931-1988). [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:1-2 [Journal]
   
2. David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan
   A Tight Amortized Bound for Path Reversal. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:3-5 [Journal]
   
3. T. Kamada, S. Kawai
   An Algorithm for Drawing General Undirected Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:7-15 [Journal]
   
4. Alok Aggarwal, Dina Kravets
   A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:17-20 [Journal]
   
5. Yves Robert, Bernard Tourancheau, G. Villard
   Data Allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:21-29 [Journal]
   
6. Richard I. Hartley
   Drawing Polygons Given Angle Sequences. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:31-33 [Journal]
   
7. Vijay Kumar
   Concurrency Control on Extendible Hashing. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:35-41 [Journal]
   
8. Stephan Olariu, J. Randall
   Welsh-Powell Opposition Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:43-46 [Journal]
   
9. S. Yu
   A Pumping Lemma for Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:31, n:1, pp:47-51 [Journal]
   
10. Hubert de Fraysseix, H. Imai
    Notes on Oriented Depth-First Search and Longest Paths. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:1, pp:53-56 [Journal]