External Links

    Journal: BIT

    Volume 24, Issue 1

    2 -- 13Donald C. S. Allison, M. T. Noga. Some Performance Tests of Convex Hull Algorithms
    14 -- 18Svante Carlsson. Improving Worst-Case Behavior of Heaps
    19 -- 32Jarmo Ernvall, Olli Nevalainen. Estimating the Length of Minimal Spanning Trees in Compression of Files
    33 -- 44Trevor I. Fenner, George Loizou. Loop-Free Algorithms for Traversing Binary Trees
    45 -- 59W.-J. Hsu, M. W. Du. Computing a Longest Common Subsequence for a Set of Strings
    60 -- 68Johann P. Malmquist, Edward L. Robertson. On the Complexity of Partitioning Sparse Matrix Representations
    runs on