BIT, Volume 27, 1987

Volume 27, Number 1, 1987

• Svante Carlsson: Average-Case Results on Heapsort. 2-17
• Rade Doroslovacki, Ivan Stojmenovic, Ratko Tosic: Generating and Counting Triangular Systems. 18-24
• Jan van Leeuwen, Jirí Wiedermann: Array Processing Machines: An Abstract Model. 25-43
• Lutz Michael Wegner: A Generalized, One-Way, Stackless Quicksort. 44-48

Volume 27, Number 2, 1987

• H. A. Burgdorff, Sushil Jajodia, Frederick N. Springsteel, Yechezkel Zalcstein: Alternative Methods for the Reconstruction of Trees from Their Traversals. 134-140
• Gen-Huey Chen, Maw-Sheng Chern, Richard C. T. Lee: A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems. 141-147
• Donald K. Friesen, Michael A. Langston: Bin Packing: On Optimizing the Number of Pieces Packed. 148-156
• George Loizou, Peter Thanisch: On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition. 157-162
• Erkki Mäkinen: Left Distance Binary Tree Representations. 163-169
• Shaunak Pawagi: Maximum Weight Independent Set in Trees. 170-180

Volume 27, Number 3, 1987

• Ferenc Belik: Deadlock Avoidance with a Modified Banker's Algorithm. 290-305
• Chin-Chen Chang, C. Y. Chen: Performance of Two-Disk Partition Data Allocations. 306-314
• A. Hasham, Jörg-Rüdiger Sack: Bounds for Min-Max Heaps. 315-323
• J. Ian Munro, Patricio V. Poblete: Searchability in Merging and Implicit Data Structures. 324-329
• Erkki Mäkinen: On Top-Down Splaying. 330-339
• M. T. Noga: Sorting in Parallel by Double Distributive Partitioning. 340-348

Volume 27, Number 4, 1987

• Mostafa A. Bassiouni, U. Khamare: Algorithms for Reducing Rollbacks in Concurrency Control by Certification. 442-457
• B. Joe, R. B. Simpson: Corrections to Lee's Visibility Polygon Algorithm. 458-473
• Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack: Algorithms for Minimum Length Partitions of Polygons. 474-479
• Rami G. Melhem: Verification of a Class of Self-Timed Computational Networks. 480-500