The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2000, volume: 74, number: 1-2

  1. Johan Håstad
    On bounded occurrence constraint satisfaction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:1-6 [Journal]
  2. François Bertault
    A force-directed algorithm that preserves edge-crossing properties. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:7-13 [Journal]
  3. Manfred Göbel
    Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:15-18 [Journal]
  4. Alok Baveja, Aravind Srinivasan
    Approximating low-congestion routing and column-restricted packing problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:19-25 [Journal]
  5. Jean-Marc Talbot
    The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:27-33 [Journal]
  6. Joachim Niehren, Sophie Tison, Ralf Treinen
    On rewrite constraints and context unification. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:35-40 [Journal]
  7. Arnold Schönhage
    Variations on computing reciprocals of power series. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:41-46 [Journal]
  8. Margus Veanes
    Farmer's Theorem revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:47-53 [Journal]
  9. Carlos H. C. Duarte, T. S. E. Maibaum
    A rely-guarantee discipline for open distributed systems design. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:55-63 [Journal]
  10. Theodosis Dimitrakos, T. S. E. Maibaum
    On a generalized modularization theorem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:65-71 [Journal]
  11. Wolfgang W. Bein, Lawrence L. Larmore
    Trackless online algorithms for the server problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:73-79 [Journal]
  12. Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li
    An algorithm for finding a k-median in a directed tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:81-88 [Journal]
  13. Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe
    Corrigendum to "Upward separation for FewP and related classes". [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:89- [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