Journals in DBLP
Zhaofang Wen Parallel Multiple Search. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:181-186 [Journal ] David Pokrass Jacobs Probabilistic Checking of Associativity in Algebras. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:187-191 [Journal ] Xiaotie Deng , Sanjeev Mahajan Server Problems and Resistive Spaces. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:193-196 [Journal ] Robert W. Irving On Approximating the Minimum Independent Dominating Set. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:197-200 [Journal ] Xuehou Tan , Tomio Hirata , Yasuyoshi Inagaki The Intersection Searching Problem for c-Oriented Polygons. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:201-204 [Journal ] Cornelis Huizing , Willem P. de Roever Introduction to Design Choices in the Semantics of Statecharts. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:205-213 [Journal ] Uri Zwick An Extension of Khrapchenko's Theorem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:215-217 [Journal ] Y. Daniel Liang , Chong Jye Rhee , Sudarshan K. Dhall , S. Lakshmivarahan A New Approach for the Domination Problem on Permutation Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:219-224 [Journal ] Peter F. Corbett , Isaac D. Scherson A Unified Algorithm for Sorting on Multidimensional Mesh-Connected Processors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:225-231 [Journal ] Maria J. Serna Approximating Linear Programming is Log-Space Complete for P. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:233-236 [Journal ] Helmut Alt , Norbert Blum , Kurt Mehlhorn , Markus Paul Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:237-240 [Journal ]