External Links

    Journal: BIT

    Volume 22, Issue 4

    402 -- 418Bjørn Kirkerud. Completeness of Hoare-Calculi Revisited
    419 -- 436Mats Löfgren, Boris Magnusson. Access Mechanisms in Block Structured Environments
    437 -- 453Peter Naur. Formalization in Program Development
    454 -- 462Mai Thanh, T. D. Bui. An Improvement of the Binary Merge Algorithm

    Volume 22, Issue 3

    274 -- 281Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood. Stabbing Line Segments
    282 -- 290Michael A. Langston. Improved 0/1-Interchange Scheduling
    291 -- 299Bengt G. Lundberg. An Axiomatization of Events
    300 -- 302A. Perko. On the Path Representation of Networks
    303 -- 312Eljas Soisalon-Soininen. Translations on a Subclass of LR(k) Grammars

    Volume 22, Issue 2

    130 -- 134Selim G. Akl. A Constant-Time Parallel Algorithm for Computing Convex Hulls
    135 -- 139Donald C. S. Allison, M. T. Noga. USORT: An Efficient Hybrid of Distributed Partitioning Sorting
    140 -- 149Robert W. Gunderson. Choosing the r-Dimension for the FCV Family of Clustering Algorithms
    150 -- 168John W. Lloyd, Kotagiri Ramamohanarao. Partial Match Retrieval for Dynamic Files
    169 -- 182Mary Lou Soffa. Control Discipline Necessity: Making the Language as General as the Implementation

    Volume 22, Issue 1

    2 -- 16Dashing Yeh. Improved Planarity Algorithms
    17 -- 26Jainendra K. Navlakha. A New Proof Technique to Establish Equivalence of the Original and the General Lambda-Free CFG with Linear Increase in Size
    27 -- 41Markku Tamminen. The Extendible Cell Method for Closest Point Problems
    42 -- 52Rodney W. Topor. Fundamental Solutions of the Eight Queens Problem
    runs on