February 1986 - Vol. 29 No. 2
Features
Combinatorics, complexity, and randomness
The 1985 Turing Award winner presents his perspective on the development of the field that has come to be called theoretical computer science.
To illustrate the "remarkable extent to which complexity theory operates by means of analogs from computability theory," Richard Karp created this conceptual map or…
Complexity and parallel processing: an interview with Richard Karp
In the following interview, which took place at ACM 85 in Denver, Karp discusses the relation of his work to leading-edge computing topics like parallel processing and…
The advantages of user-defined distfix operators—a syntactic convenience that enhances the readability of programs—can be obtained as an extension of almost…
A note on the Berry-Meekings style metric
A modification of the Berry-Meekings "style metric"—applied to software from the corporate environment—finds little relationship between this style metric and…
Program style analysis: a natural by-product of program compilation
Analyzing program style may be properly considered an integral part of program compilation—as successfully implemented in two style-analysis tools for Fortran 77:…
Dynamic initial allocation and local reallocation procedures for multiple stacks
Two new procedures for manipulating multiple stacks which share sequential memory locations are discussed. The first is the dynamic initial allocation procedure in which…
Organizational power and the information services department: a reexamination
In a recent application of the theory of strategic contingencies in three large multinational firms, Lucas found that information services departments were perceived by…