External Links

    Journal: BIT

    Volume 26, Issue 4

    402 -- 409Keith Brinck. Computing Parent Nodes in Threaded Binary Trees
    410 -- 417Chin-Chen Chang. On the Design of a Key-Lock-Pair Mechanism in Information Protection Systems
    418 -- 429Pranay Chaudhuri, Ratan K. Ghosh. Parallel Algorithms for Analyzing Activity Networks
    430 -- 441Wm. Randolph Franklin, Varol Akman. Reconstructing Visible Regions from Visible Segments
    442 -- 450Shou-Hsuan Stephen Huang. Ordered Priority Queues
    451 -- 466Robert Schreiber, Wei-Pai Tang. On On Systolic Arrays for Updating the Cholesky Factorization
    467 -- 474D. Yun Yeh. A Dynamic Programming Approach to the Complete Set Partitioning Problem

    Volume 26, Issue 3

    266 -- 276Alfs T. Berztiss. A Taxonomy of Binary Tree Traversals
    277 -- 283Gen-Huey Chen, Maw-Sheng Chern. Parallel Generation of Permutations and Conbinations
    284 -- 294Jakob Krarup, Peter M. Pruzan. Assessment of Approximate Algorithms: The Error Measure s Crucial Role
    295 -- 302Sigurd Meldal. Partial Correctness of Exits from Concurrent Structures
    303 -- 316Robert Schreiber. On Systolic Array Methods for Band Matrix Factorizations

    Volume 26, Issue 2

    138 -- 147Hung-Chang Du. Disk Allocation Methods for Binary Cartesian Product Files
    148 -- 155Anders Edenbrandt. Quotient Tree Partitioning of Undirected Graphs
    156 -- 163Jeffrey H. Kingston. The Amortized Complexity of Henriksen s Algorithm
    164 -- 174Sigurd Meldal. An Axiomatic Semantics for Nested Concurrency
    175 -- 187Peter Naur. Thinking and Turing s Test
    188 -- 194Heikki Saikkonen, Stefan Rönn. Distributed Termination on a Ring
    195 -- 198Y. Zhang. A Note on Parallel Depth First Search

    Volume 26, Issue 1

    2 -- 6Becky Chan, Selim G. Akl. Generating Combinations in Parallel
    7 -- 16R. C. Chang, Richard C. T. Lee. An ::::O::::(::::N:::: log ::::N::::) Minimal Spanning Tree Algorithm for ::::N:::: Points in the Plane
    17 -- 34Guy Louchard. Brownian Motion and Algorithm Complexity
    35 -- 43Michael J. Quinn, Narsingh Deo. An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms
    44 -- 62Pawel Winter. An Algorithm for the Enumeration of Spanning Trees
    runs on