BIT,
Volume 20,
1980
This index includes only papers from the Computer Science section of BIT.
Volume 20,
Number 1,
1980
Part 1 - Computer Science
- 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
Part 1 - Computer Science
- 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-163
- Jerker Wilander:
An Interactive Programming System for Pascal.
163-174
Volume 20,
Number 3,
1980
Part 1 - Computer Science
Volume 20,
Number 4,
1980
Part 1 - Computer Science
Copyright © Fri Mar 12 17:24:45 2010
by Michael Ley (ley@uni-trier.de)