The SCEAS System
Navigation Menu

Journals in DBLP

Nord. J. Comput.
1994, volume: 1, number: 4

  1. Sven Skyum
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:387-0 [Journal]
  2. Peter Becker
    A New Algorithm for the Construction of Optimal B-Trees. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:389-401 [Journal]
  3. Eric Schenk
    Parallel Dynamic Lowest Common Ancestors. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:402-432 [Journal]
  4. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    Finding all Weakly-Visible Chords of a Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:433-457 [Journal]
  5. Sven Schuierer
    An O(log log n) Time Algorithm to Compute the Kernel of a Polygon. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:458-474 [Journal]
  6. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:475-492 [Journal]
  7. Marcus Peinado
    Hard Graphs for the Randomized Boppana-Halldörsson Algorithm for MAXCLIQUE. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:493-0 [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