The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1987, volume: 26, number: 4

  1. Krzysztof R. Apt, Luc Bougé, Ph. Clermont
    Two Normal Form Theorems for CSP Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:165-171 [Journal]
  2. Michael T. Goodrich
    Finding the Convex Hull of a Sorted Point Set in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:173-179 [Journal]
  3. Ursula Martin
    Extension Functions for Multiset Orderings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:181-186 [Journal]
  4. Shlomit S. Pinter, Yaron Wolfstahl
    Embedding Ternary Trees in VLSI Arrays. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:187-191 [Journal]
  5. Ulrich Güntzer, Manfred Paul
    Jump Interpolation Search Trees and Symmetric Binary Numbers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:193-204 [Journal]
  6. Tadao Takaoka
    A Decomposition Rule for the Hoare Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:205-208 [Journal]
  7. Alberto Apostolico, Susanne E. Hambrusch
    Finding Maximum Cliques on Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:209-215 [Journal]
  8. C. Baleanu, D. Tomescu
    An Architecture for Symbolic Processing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:217-222 [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