Journals in DBLP
Jan van den Bos PROCOL: A Protocol-Constrained Concurrent Object-Oriented Language. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:221-227 [Journal ] Rainer Kemp A One-to-One Correspondence between two Classes of Ordered Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:229-234 [Journal ] Nissim Francez Cooperating Proofs for Distributed Programs with Multiparty Interactions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:235-242 [Journal ] Hazel Everett , A. Gupta Acyclic Directed Hypercubes may have Exponential Diameter. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:243-245 [Journal ] Grant A. Cheston , Arthur M. Farley , Stephen T. Hedetniemi , Andrzej Proskurowski Centering a Spanning Tree of a Biconnected Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:247-250 [Journal ] David A. Mix Barrington , James C. Corbett On the Relative Complexity of Some Languages in NC. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:251-256 [Journal ] A. Clouatre , Normand Laliberte , T. H. Merrett A General Implementation of Relational Recursion with Speedup Techniques for Programmers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:257-262 [Journal ] George H. Roberts Another Note on Recursive Ascent. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:263-266 [Journal ] Gerd Baron , Friedrich J. Urbanek Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:267-269 [Journal ] Erkki Mäkinen On the Subtree Isomorphism Problem for Ordered Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:271-273 [Journal ] P. P. Chakrabarti , Sujoy Ghose , A. Pandey , S. C. De Sarkar Increasing Search Efficiency Using Multiple Heuristics. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:275-275 [Journal ]