Journals in DBLP

BIT
1984, volume: 24, number: 1

1. Donald C. S. Allison, M. T. Noga
   Some Performance Tests of Convex Hull Algorithms. [Citation Graph (0, 0)][DBLP]
   BIT, 1984, v:24, n:1, pp:2-13 [Journal]
   
2. Svante Carlsson
   Improving Worst-Case Behavior of Heaps. [Citation Graph (0, 0)][DBLP]
   BIT, 1984, v:24, n:1, pp:14-18 [Journal]
   
3. Jarmo Ernvall, Olli Nevalainen
   Estimating the Length of Minimal Spanning Trees in Compression of Files. [Citation Graph (0, 0)][DBLP]
   BIT, 1984, v:24, n:1, pp:19-32 [Journal]
   
4. Trevor I. Fenner, George Loizou
   Loop-Free Algorithms for Traversing Binary Trees. [Citation Graph (0, 0)][DBLP]
   BIT, 1984, v:24, n:1, pp:33-44 [Journal]
   
5. W. J. Hsu, M. W. Du
   Computing a Longest Common Subsequence for a Set of Strings. [Citation Graph (0, 0)][DBLP]
   BIT, 1984, v:24, n:1, pp:45-59 [Journal]
   
6. Johann P. Malmquist, Edward L. Robertson
   On the Complexity of Partitioning Sparse Matrix Representations. [Citation Graph (0, 0)][DBLP]
   BIT, 1984, v:24, n:1, pp:60-68 [Journal]