The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1996, volume: 60, number: 3

  1. Richard Banach
    Transitive Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:109-114 [Journal]
  2. Úlfar Erlingsson, Mukkai S. Krishnamoorthy, T. V. Raman
    Efficient Multiway Radix Search Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:115-120 [Journal]
  3. Otfried Schwarzkopf, Jules Vleugels
    Range Searching in Low-Density Environments. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:121-127 [Journal]
  4. Ching-Tsun Chou
    Simple Proof Techniques for Property Preservation via Simulation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:129-134 [Journal]
  5. Tsong Yueh Chen, Man Fai Lau
    Dividing Strategies for the Optimization of a Test Suite. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:135-141 [Journal]
  6. Ronald E. Prather
    The Subprogram Problem for Software Metric Design. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:143-149 [Journal]
  7. Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott
    An Efficient Algorithm for Concurrent Priority Queue Heaps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:151-157 [Journal]
  8. Y. Daniel Liang, Chongkye Rhee
    Finding Biconnected Components in O(n) Time for a Class of Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:159-163 [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