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

Volume 30, Number 1, 1990

Part 1 - Computer Science

• 
  Nils Andersen: A General Transposition Method for a Matrix on Auxiliary Store. 2-16
• 
  Bruce L. Bauslaugh, Frank Ruskey: Generating Alternating Permutations Lexicographically. 17-26
• 
  Chin-Chen Chang, Chu-Hsing Lin: A Reciprocal Confluence Tree Unit and Its Applications. 27-33
• 
  Sushil Jajodia, Frederick N. Springsteel: Lossless Outer Joins with Incomplete Information. 34-41
• 
  Sheau-Dong Lang: Analysis of Recursive Batched Interpolation Search. 42-50
• 
  Arch D. Robison: An Improved Rewriting-Number Algorithm. 51-61
• 
  Renzo Sprugnoli: Counting Labels in Binary Trees. 62-69
• 
  Alan Stewart: An Axiomatic Treatment of SIMD Assignment. 70-82
• 
  Maciej M. Syslo, Pawel Winter: In-Trees and Plane Embeddings of Outerplanar Graphs. 83-90

Volume 30, Number 2, 1990

Part 1 - Computer Science

• 
  Craig C. Douglas, Willard L. Miranker: The Multilevel Principle Applied to Sorting. 178-195
• 
  Nen-Fu Huang: A Divide-and-Conquer Algorithm for Constructing Relative Neighborhood Graph. 196-206
• 
  Shou-Hsuan Stephen Huang, Venkatraman Viswanathan: On the Construction of Weighted Time-Optimal B-Trees. 207-215
• 
  Yannis Manolopoulos, John G. Kollias: Optimal Data Placement in Two-Headed Disk Systems. 216-219
• 
  J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe: Stable in Situ Sorting and Minimum Data Movement. 220-234
• 
  Vincent G. Winters: Minimal Perfect Hashing in Polynomial Time. 235-244
• 
  Mohammad Zubair, S. N. Gupta: Embeddings on a Boolean Cube. 245-256

Volume 30, Number 3, 1990

Part 1 - Computer Science

• 
  Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: A Sublogarithmic Convex Hull Algorithm. 378-384
• 
  Mark H. Overmars, Haijo Schipper, Micha Sharir: Storing Line Segments in Partition Trees. 385-403
• 
  Kotagiri Ramamohanarao, John Shepherd, Ron Sacks-Davis: Multi-Attribute Hashing with Multiple File Copies for High Performance Partial-Match Retrieval. 404-423
• 
  Ivan Stojmenovic: An Optimal Algorithm for Generating Equivalence Relations on a Linear Array of Processors. 424-436
• 
  Jorma Tarhio: Uncle-Atrributed Grammars. 437-449
• 
  Ravi Varadarajan: Partitioning Multi-Edge Graphs. 450-463

Volume 30, Number 4, 1990

Part 1 - Computer Science

• 
  Chiuyuan Chen, Ruei-Chuan Chang: On the Minimality of Polygon Triangualtion. 570-582
• 
  Zbigniew Kokosinski: On Generation of Permutations Through Decomposition of Symmetric Groups Into Cosets. 583-591
• 
  R. T. Kuo, S. S. Tseng: On the Invariance of Male Optimal Stable Matching. 592-598
• 
  Heikki Mannila, Esko Ukkonen: Unifications, Deunifications, and Their Complexity. 599-619
• 
  Yannis Manolopoulos, Christos Faloutsos: Analysis for the End of Block Wasted Space. 620-630
• 
  Jimmy J. M. Tan: A Maximum Stable Matching for the Roommates Problem. 631-640