The SCEAS System
Navigation Menu

Journals in DBLP

BIT
1986, volume: 26, number: 1

  1. Becky Chan, Selim G. Akl
    Generating Combinations in Parallel. [Citation Graph (0, 0)][DBLP]
    BIT, 1986, v:26, n:1, pp:2-6 [Journal]
  2. R. C. Chang, Richard C. T. Lee
    An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane. [Citation Graph (0, 0)][DBLP]
    BIT, 1986, v:26, n:1, pp:7-16 [Journal]
  3. Guy Louchard
    Brownian Motion and Algorithm Complexity. [Citation Graph (0, 0)][DBLP]
    BIT, 1986, v:26, n:1, pp:17-34 [Journal]
  4. Michael J. Quinn, Narsingh Deo
    An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. [Citation Graph (0, 0)][DBLP]
    BIT, 1986, v:26, n:1, pp:35-43 [Journal]
  5. Pawel Winter
    An Algorithm for the Enumeration of Spanning Trees. [Citation Graph (0, 0)][DBLP]
    BIT, 1986, v:26, n:1, pp:44-62 [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