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

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

Part 1 - Computer Science

Stefan Arnborg: A Simple Query Language Based on Set Algebra. 266-278
D. Julian M. Davies: The Fifty Percent Rule Revisited. 279-288
P. 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

Part 1 - Computer Science

Anker Helms Jørgensen: A Methodology for Measuring the Readability and Modifiability of Computer Programs. 394-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

Last update Wed May 22 17:04:06 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page