External Links

    Journal: BIT

    Volume 21, Issue 4

    390 -- 400James K. Mullin. Tightly Controlled Linear Hashing without Separate Overflow Storage
    401 -- 418Aris M. Ouksel, Peter Scheuermann. Multidimensional B-Trees: Analysis of Dynamic Behavior
    419 -- 435Markku Tamminen. Order Preserving Extendible Hashing and Bucket Tries
    436 -- 448Peter J. L. Wallis. Some Primitives for the Portable Programming of Arrays and Vector Processors

    Volume 21, Issue 3

    246 -- 254Philippe Darondeau, Paul Le Guernic, Michel Raynal. Types in a Mixed Language System
    255 -- 269Ernst-Erich Doberkat. Inserting a New Element in a Heap
    270 -- 293Bent Bruun Kristensen, Ole Lehrmann Madsen. Diagnostics on LALR(k) Conflicts Based on a Method for LR(k) Testing
    294 -- 304C. M. Lam, K. T. Fung. A Quadratic Programming Model for Optimal Data Distribution
    305 -- 316Renzo Sprugnoli. On the Allocation of Binary Trees to Secondary Storage

    Volume 21, Issue 2

    142 -- 152Harvey K. Brock, Barbara J. Brooks, Francis Sullivan. Diamond - A Sorting Method for Vector Machines
    153 -- 156Trevor I. Fenner, George Loizou. A Note on Traversal Algorithms for Triply Linked Binary Trees

    Volume 21, Issue 1

    2 -- 19Hannu Erkiö. Speeding Sort Algorithms by Special Instructions
    20 -- 30Stephen Y. Itoga. The String Merging Problem
    31 -- 36Donald E. Knuth. Verification of Link-Level Protocols
    37 -- 45Bengt G. Lundberg. On Consistency of Information Models
    46 -- 54Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen. Finding Minimal Spanning Trees in a Euclidean Coordinate Space
    runs on