default search action
BIT, Volume 20, 1980
Volume 20, Number 1, 1980
- Selim G. Akl:
A New Algorithm for Generating Derangements. 2-7 - W. M. Chan, Alan George:
A Linear Time Implementation of the Reverse Cuthill-McKee Algorithm. 8-14 - Pertti Järvinen:
On Structuring Problems of Job Design Met in the Development and Maintenance of Information Systems. 15-24 - Per-Åke Larson:
Analysis of Repeated Hashing. 25-32
Volume 20, Number 2, 1980
- Hannu Erkiö:
A Heuristic Approximation of the Worst Case of Shellsort. 130-136 - Stein Gjessing:
Monitors with Arrays of Condition Variables and Proof Rules Handling Local Quantities. 137-144 - Juha Hakola, Ari Heiskanen:
On the Distribution of Wasted Space at the End of File Blocks. 145-156 - Rainer Kemp:
A Note on the Stack Size of Regularly Distributed Binary Trees. 157-162 - Jerker Wilander:
An Interactive Programming System for Pascal. 163-174
Volume 20, Number 3, 1980
- Stefan Arnborg:
A Simple Query Language Based on Set Algebra. 265-278 - D. Julian M. Davies:
The Fifty Percent Rule Revisited. 279-288 - Pieter W. Hemker:
On the Structure of an Adaptive Multi-Level Algorithm. 289-301 - Thomas Ottmann, Wolffried Stucky:
Higher Order Analysis of Random 1-2 Brother Trees. 302-314
Volume 20, Number 4, 1980
- Anker Helms Jørgensen:
A Methodology for Measuring the Readability and Modifiability of Computer Programs. 393-405 - John W. Lloyd:
Optimal Partial-Match Retrieval. 406-413 - Peter Naur:
Impressions of the Early Days of Programming. 414-425 - Hans-Werner Six, Derick Wood:
The Rectangle Intersection Problem Revisited. 426-433 - Dan Strömberg, Peter Fritzson:
Transfer of Programs from Development to Runtime Environments. 434-442
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.