March 1987 - Vol. 30 No. 3
Features
Computer science: the emergence of a discipline
The continued rapid development of computer science will require an expansion of the science base and an influx of talented new researchers. Computers have already…
The quest for efficiency in computational methods yields not only fast algorithms, but also insights that lead to elegant, simple, and general problem-solving methods.
An interview with the 1986 A. M. Turing Award recipients—John E. Hopcroft and Robert E. Tarjan
In the following interview, which took place at the 1986 Fall Joint Computer Conference in Dallas, Texas, John Hopcroft and Robert Tarjan discuss their collaboration and…
Automatic correction to misspelled names: a fourth-generation language approach
Using an information theoretic likeness measure defined as an inner product on a data space created from a table of valid names, this 4GL procedure searches the database…
Instead of limiting functionality, usability complements functionality. It affects how and with what effectiveness a system is used, and even whether or not it is used at…
Pairing heaps: experiments and analysis
The pairing heap has recently been introduced as a new data structure for priority queues. Pairing heaps are extremely simple to implement and seem to be very efficient…
The effect of data structures on the logical complexity of programs
The logical complexity of a program is a measure of the effort required to understand it. We hypothesize that the logical complexity of a program increases with the…