BIT, Volume 29, 1989

This index includes only papers from the Computer Science section of BIT.

Volume 29, Number 1, 1989

Part 1 - Computer Science

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

Part 1 - Computer Science

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

Part 1 - Computer Science

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