The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1991, volume: 37, number: 4

  1. Zhaofang Wen
    Parallel Multiple Search. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:4, pp:181-186 [Journal]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002