The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1992, volume: 42, number: 6

  1. Glenn K. Manacher, Terrance A. Mankus
    Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:293-294 [Journal]
  2. Peter Bro Miltersen
    Circuit Depth Relative to a Random Oracle. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:295-298 [Journal]
  3. Gerhard J. Woeginger, Zhongliang Yu
    On the Equal-Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:299-302 [Journal]
  4. Binhai Zhu
    Computing the Shortest Diagonal of a Monotone Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:303-307 [Journal]
  5. Elias Dahlhaus, Marek Karpinski, Pierre Kelsen
    An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:309-313 [Journal]
  6. Clifford Stein, Joel Wein
    Approximating the Minimum-Cost Maximum Flow is P-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:315-319 [Journal]
  7. Samir Khuller, Baruch Schieber
    On Independent Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:321-323 [Journal]
  8. Kenichi Morita
    Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:325-329 [Journal]
  9. Antonio Brogi, Anna Ciampolini, Evelina Lamma, Paola Mello
    The Implementation of a Distributed Model for Logic Programming Based on Multiple-Headed Clauses. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:331-338 [Journal]
  10. Eric Goles Ch., Servet Martínez A.
    Automata Networks and Optimization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:339-343 [Journal]
  11. Nancy G. Kinnersley
    The Vertex Separation Number of a Graph equals its Path-Width. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:345-350 [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