BIT, Volume 23, 1983

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

Volume 23, Number 1, 1983

Jyrki Katajainen: On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space. 2-8
Peter Kornerup, R. T. Gregory: Mapping Integers and Hensel Codes onto Farey Fractions. 9-20
Franco Turini: Abstractions of Control Environments. 21-35
Dashing Yeh: On Incremental Shift-Reduce Parsing. 36-48

Gunner Helweg Johansen, Chr. Gram: A Simple Algorithm for Building the 3-D Convex Hull. 146-160
Stephen Y. Itoga: A Probabilistic Version of the Stable Marriage Problem. 161-169
Jack A. Orenstein, T. H. Merrett, Luc Devroye: Linear Sorting with O(log n) Processors. 170-180
Esko Ukkonen: Exponential Lower Bounds for Some NP-Complete Problems in a Restricted Linear Decision Tree Model. 181-192

Walter A. Burkhard: Interpolation-Based Index Maintenance. 274-294
M. C. Er: An Iterative Solution to the Generalized Towers of Hanoi Problem. 295-302
Henrik Legind Larsen: Generalized Double Modulo 11 Check Digit Error Detection. 303-307
Dashing Yeh: On Incremental Evaluation of Ordered Attribute Grammars. 308-320

Vangalur S. Alagar, T. D. Bui, Mai Thanh: Efficient Algorithms for Merging. 410-428
M. C. Er: An Analysis of the Generalized Towers of Hanoi Problem. 429-435
Shou-Hsuan Stephen Huang, C. K. Wong: Binary Search Trees with Limited Rotation. 436-455
Tina M. Nicholl, D. T. Lee, Yuh-Zen Liao, Chak-Kuen Wong: On the X-Y Convex Hull of a Set of X-Y Polygons. 456-471
V. K. Raman, S. Sitharama Iyengar: Properties and Applications of Forests of Quadtrees. 472- 486