BIT, Volume 26, 1986

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

Volume 26, Number 1, 1986

Part 1 - Computer Science

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

Part 1 - Computer Science

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

Part 1 - Computer Science

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

Part 1 - Computer Science

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