
Journals in DBLP
 Vadim E. Kotov
Andrei P. Ershov (19311988). [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:1, pp:12 [Journal]
 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:35 [Journal]
 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:715 [Journal]
 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:1720 [Journal]
 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:2129 [Journal]
 Richard I. Hartley
Drawing Polygons Given Angle Sequences. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:1, pp:3133 [Journal]
 Vijay Kumar
Concurrency Control on Extendible Hashing. [Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:1, pp:3541 [Journal]
 Stephan Olariu, J. Randall
WelshPowell Opposition Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:1, pp:4346 [Journal]
 S. Yu
A Pumping Lemma for Deterministic ContextFree Languages. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:1, pp:4751 [Journal]
 Hubert de Fraysseix, H. Imai
Notes on Oriented DepthFirst Search and Longest Paths. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:1, pp:5356 [Journal]
