BIT, Volume 21, 1981

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

Volume 21, Number 1, 1981

Hannu Erkiö: Speeding Sort Algorithms by Special Instructions. 2-19 BibTeX
Stephen Y. Itoga: The String Merging Problem. 20-30 BibTeX
Donald E. Knuth: Verification of Link-Level Protocols. 31-36 BibTeX
Bengt G. Lundberg: On Consistency of Information Models. 37-45 BibTeX
Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen: Finding Minimal Spanning Trees in a Euclidean Coordinate Space. 46-54 BibTeX

Harvey K. Brock, Barbara J. Brooks, Francis Sullivan: Diamond - A Sorting Method for Vector Machines. 142-152 BibTeX
Trevor I. Fenner, George Loizou: A Note on Traversal Algorithms for Triply Linked Binary Trees. 153-156 BibTeX
Jin Kiu Wong: Some Simple In-Place Merging Algorithms. 157-166 BibTeX

Philippe Darondeau, Paul Le Guernic, Michel Raynal: Types in a Mixed Language System. 246-254 BibTeX
Ernst-Erich Doberkat: Inserting a New Element in a Heap. 255-269 BibTeX
Bent Bruun Kristensen, Ole Lehrmann Madsen: Diagnostics on LALR(k) Conflicts Based on a Method for LR(k) Testing. 270-293 BibTeX
C. M. Lam, K. T. Fung: A Quadratic Programming Model for Optimal Data Distribution. 294-304 BibTeX
Renzo Sprugnoli: On the Allocation of Binary Trees to Secondary Storage. 305-316 BibTeX

James K. Mullin: Tightly Controlled Linear Hashing without Separate Overflow Storage. 390-400 BibTeX
Aris M. Ouksel, Peter Scheuermann: Multidimensional B-Trees: Analysis of Dynamic Behavior. 401-418 BibTeX
Markku Tamminen: Order Preserving Extendible Hashing and Bucket Tries. 419-435 BibTeX
Peter J. L. Wallis: Some Primitives for the Portable Programming of Arrays and Vector Processors. 436-448 BibTeX