External Links

    Journal: BIT

    Volume 24, Issue 3

    262 -- 268Mee Yee Chan. Multidisk File Design: An Analysis of Folding Buckets to Disks
    269 -- 273R. C. Chang, Richard C. T. Lee. On the Average Length of Delaunay Triangulations
    274 -- 287P. Gupta, G. P. Bhattacharjee. A Parallel Selection Algorithm
    288 -- 301Bengt Nordström, Jan M. Smith. Propositions and Specifications of Programs in Martin-Löfs Type Theory
    302 -- 307G. M. Prabhu, Narsingh Deo. On the Power of a Perturbation for Testing Non-Isomorphism of Graphs
    308 -- 316S. S. Tseng, Richard C. T. Lee. A Parallel Algorithm to Solve the Stable Marriage Problem
    317 -- 332Aimo A. Törn. Hashing with Overflow Indexing
    333 -- 340D. Y. Yeh, D. T. Lee. Graph Algorithms on a Tree-Structured Parallel Computer

    Volume 24, Issue 2

    134 -- 150Ratan K. Ghosh, G. P. Bhattacharjee. A Parallel Search Algorithm for Directed Acyclic Graphs
    151 -- 163Arne Maus. Delaunay Triangulation and the Convex Hull of ::::n:::: Points in Expected Linear Time
    164 -- 170Erkki Mäkinen. On Context-Free and Szilard Languages
    171 -- 186Timo Niemi. Specification of a Query Language by the Attribute Method
    187 -- 195S. S. Tseng, Richard C. T. Lee. A New Parallel Sorting Algorithm Based Upon Min-Mid-Max Operations
    196 -- 204Shmuel Zaks. A New Algorithm for Generation of Permutations

    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