


default search action
BIT, Volume 21, 1981
Volume 21, Number 1, 1981
- Hannu Erkiö:

Speeding Sort Algorithms by Special Instructions. 2-19 - Stephen Y. Itoga:

The String Merging Problem. 20-30 - Donald E. Knuth:

Verification of Link-Level Protocols. 31-36 - Bengt G. Lundberg:

On Consistency of Information Models. 37-45 - Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen:

Finding Minimal Spanning Trees in a Euclidean Coordinate Space. 46-54
Volume 21, Number 2, 1981
- Harvey K. Brock, Barbara J. Brooks, Francis Sullivan:

Diamond - A Sorting Method for Vector Machines. 142-152 - Trevor I. Fenner, George Loizou:

A Note on Traversal Algorithms for Triply Linked Binary Trees. 153-156 - Jin Kiu Wong:

Some Simple In-Place Merging Algorithms. 157-166
Volume 21, Number 3, 1981
- Philippe Darondeau, Paul Le Guernic, Michel Raynal:

Types in a Mixed Language System. 245-254 - Ernst-Erich Doberkat:

Inserting a New Element in a Heap. 255-269 - Bent Bruun Kristensen

, Ole Lehrmann Madsen
:
Diagnostics on LALR(k) Conflicts Based on a Method for LR(k) Testing. 270-293 - C. M. Lam, K. T. Fung:

A Quadratic Programming Model for Optimal Data Distribution. 294-304 - Renzo Sprugnoli:

On the Allocation of Binary Trees to Secondary Storage. 305-316
Volume 21, Number 4, 1981
- James K. Mullin:

Tightly Controlled Linear Hashing without Separate Overflow Storage. 390-400 - Aris M. Ouksel, Peter Scheuermann:

Multidimensional B-Trees: Analysis of Dynamic Behavior. 401-418 - Markku Tamminen:

Order Preserving Extendible Hashing and Bucket Tries. 419-435 - Peter J. L. Wallis:

Some Primitives for the Portable Programming of Arrays and Vector Processors. 436-448

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














