The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

BIT
1981, volume: 21, number: 4

  1. James K. Mullin
    Tightly Controlled Linear Hashing without Separate Overflow Storage. [Citation Graph (12, 0)][DBLP]
    BIT, 1981, v:21, n:4, pp:390-400 [Journal]
  2. Aris M. Ouksel, Peter Scheuermann
    Multidimensional B-Trees: Analysis of Dynamic Behavior. [Citation Graph (3, 0)][DBLP]
    BIT, 1981, v:21, n:4, pp:401-418 [Journal]
  3. Markku Tamminen
    Order Preserving Extendible Hashing and Bucket Tries. [Citation Graph (5, 0)][DBLP]
    BIT, 1981, v:21, n:4, pp:419-435 [Journal]
  4. Peter J. L. Wallis
    Some Primitives for the Portable Programming of Arrays and Vector Processors. [Citation Graph (0, 0)][DBLP]
    BIT, 1981, v:21, n:4, pp:436-448 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002