External Links

    Journal: BIT

    Volume 29, Issue 3

    378 -- 394Ricardo A. Baeza-Yates. A Trivial Algorithm Whose Analysis is Not: A Continuation
    395 -- 408Per Galle. Branch & Sample: A Simple Strategy for Constraint Satisfaction
    409 -- 427Rami G. Melhem, Concettina Guerra. The Application of a Sequence Notation to the Design of Systolic Computations
    428 -- 447Peter Scheuermann, Young Chul Park, Edward Omiecinski. A Heuristic File Reorganization Algorithm Based on Record Clustering
    448 -- 456S. S. Tseng. The Average Performance of a Parallel Stable Marriage Algorithm

    Volume 29, Issue 2

    186 -- 211William Gropp, Ilse C. F. Ipsen. Recursive Mesh Refinement on Hypercubes
    212 -- 216Nen-Fu Huang, Tsing-Her Huang. On the Complexity of Some Arborescences Finding Problems on a Multihop Radio Network
    217 -- 226Shing-Tsaan Huang, Ming-Shin Tsai. A Linear Systolic Algorithm for the Connected Component Problem
    227 -- 238Matti O. Jokinen. Automatically Replacing Indices Into Parallel Arrays with Pointers to Records
    239 -- 250Michael J. Quinn. Analysis and Benchmarking of Two Parallel Sorting Algorithms: Hyperquicksort and Quickmerge
    251 -- 256Thomas Strothotte, Patrik Eriksson, Sören Vallner. A Note on Constructing Min-Max Heaps

    Volume 29, Issue 1

    2 -- 13Marco Gori, Giovanni Soda. An Algebraic Approach to Cichelli s Perfect Hashing
    14 -- 22P. Gupta, G. P. Bhattacharjee. A Parallel Derangement Generation Algorithm
    23 -- 36Chau-Jy Lin, Jong-Chuang Tsay. A Systolic Generation of Combinations
    37 -- 40Ernst S. Selmer. On Shellsort and the Frobenius Problem
    41 -- 46Eugene Veklerov. On the Decomposability of the Stable Marriage Problem
    runs on