Journals in DBLP
David Avis , J. M. Robert , Rephael Wenger Lower Bounds for Line Stabbing. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:59-62 [Journal ] Christian Buchta On the Average Number of Maxima in a Set of Vectors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:63-65 [Journal ] Kuo-Liang Chung , Wen-Chin Chen , Ferng-Ching Lin Fast Computation of Periodic Continued Fractions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:67-72 [Journal ] Andrzej Szepietowski Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:73-78 [Journal ] Winfried Thome , Reinhard Wilhelm Simulating Circular Attribute Grammars Through Attribute Reevaluation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:79-81 [Journal ] Martin Dietzfelbinger The Speed of Copying on One-Tape Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:83-89 [Journal ] Alejandro A. Schäffer Optimal Node Ranking of Trees in Linear Time. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:91-96 [Journal ] Stefano Ceri , Georg Gottlob , Letizia Tanca , Gio Wiederhold Magic Semi-Joins. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:97-107 [Journal ] Andrzej Szepietowski Some Notes on Strong and Weak log log n Space Complexity. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:109-112 [Journal ]