BIT, Volume 22, 1982

Volume 22, Number 1, 1982

• Dashing Yeh: Improved Planarity Algorithms. 2-16
• Jainendra K. Navlakha: A New Proof Technique to Establish Equivalence of the Original and the General Lambda-Free CFG with Linear Increase in Size. 17-26
• Markku Tamminen: The Extendible Cell Method for Closest Point Problems. 27-41
• Rodney W. Topor: Fundamental Solutions of the Eight Queens Problem. 42-52

Volume 22, Number 2, 1982

• Selim G. Akl: A Constant-Time Parallel Algorithm for Computing Convex Hulls. 130-134
• Donald C. S. Allison, M. T. Noga: USORT: An Efficient Hybrid of Distributed Partitioning Sorting. 135-139
• Robert W. Gunderson: Choosing the r-Dimension for the FCV Family of Clustering Algorithms. 140-149
• John W. Lloyd, Kotagiri Ramamohanarao: Partial Match Retrieval for Dynamic Files. 150-168
• Mary Lou Soffa: Control Discipline Necessity: Making the Language as General as the Implementation. 169-182

Volume 22, Number 3, 1982

• Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood: Stabbing Line Segments. 274-281
• Michael A. Langston: Improved 0/1-Interchange Scheduling. 282-290
• Bengt G. Lundberg: An Axiomatization of Events. 291-299
• A. Perko: On the Path Representation of Networks. 300-302
• Eljas Soisalon-Soininen: Translations on a Subclass of LR(k) Grammars. 303-312

Volume 22, Number 4, 1982

• Bjørn Kirkerud: Completeness of Hoare-Calculi Revisited. 402-418
• Mats Löfgren, Boris Magnusson: Access Mechanisms in Block Structured Environments. 419-436
• Peter Naur: Formalization in Program Development. 437-453
• Mai Thanh, T. D. Bui: An Improvement of the Binary Merge Algorithm. 454-462