BIT, Volume 31, 1991

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

Volume 31, Number 1, 1991

Oliver Günther, Eugene Wong: A Dual Approach to Detect Polyhedral Intersections in Arbitrary Demensions. 3-14
Ben Johnsen: Generating Binary Trees with Uniform Probability. 15-31
John Konvalina, Yi-Hsin Liu: Bit Strings Without q-Separation. 32-35
Vijay K. Vaishnavi, Timothy D. Korson: Height-Analysis of k-Dimensional Leaf and Node Height-Balanced Trees: A New Approach. 36-49
H. Van de Vel, Sun Shijie: A Modification of Hochbaum and Shmoys' Algorithm for Scheduling Problems. 50-52
Shyan-Ming Yuan: An Efficient Fault-Tolerant Decentralized Commit Protocol for Single Site Failure. 53-68
Weixiong Zhang, Nageswara S. V. Rao: Optimal Parallel Quicksort on Erew Pram. 69-74

Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher: Efficient Reduction for Path Problems on Circular-Arc Graphs. 182-193
M. D. Atkinson: The Recursive Structure of Some Ordering Problems. 194-201
Marc J. van Kreveld, Mark de Berg: Finding Squares and Rectangles in Sets of Points. 202-219
Lung-Tien Liu, Gen-Huey Chen, Yue-Li Wang: A Note on Optimal Multiway Split Trees. 220-229
Cao An Wang: Finding Minimal Nested Polygons. 230-236

Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo: The Set Union Problem with Dynamic Weighted Backtracking. 383-393
Per Grape: Complete Problems with L-Samplable Distributions. 394-405
Juha Puustjärvi: Distributed Management of Transactions in Heterogeneous Distributed Database Systems. 406-420
Haijo Schipper, Mark H. Overmars: Dynamic Partition Trees. 421-436

Frank Bartling, Klaus Hinrichs: Probabilistic Analysis of an Algorithm for Solving the k-Dimensional All-Nearest-Neighbors Problem by Projection. 558-565
C. Y. Chen, H. F. Lin: Optimality Criteria of the Disk Modulo Allocation Method for Cartesian Product Files. 566-575
Jaana Eloranta: Minimizing the Number of Transitions with Respect to Observation Equivalence. 576-590
Andrzej Lingas: An Unfeasible Matching Problem. 591-597
Kim-Heng Teo, Tai-Ching Tuan: A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths. 598-606