Rosalie Steier
Pages 191-192
Paul Abrahamsss
Pages 193-194
Robert L. Ashenhurst
Pages 195-196
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 altered the way we think and live; now they will begin to elevate …
John E. Hopcroft
Pages 198-202
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.
Robert E. Tarjan
Pages 204-212
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 space for the nearest correctly spelled name.
Michael Allen Bickel
Pages 224-228
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 all.
Nancy C. Goodwin
Pages 229-233
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 in practice, but they are difficult to analyze theoretically …
John T. Stasko, Jeffrey Scott Vitter
Pages 234-249
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 increase in the opaqueness of the relationship between the physical …
Farokh B. Bastani, S. Sitharama Iyengar
Pages 250-259
CORPORATE Tech Correspondence
Pages 260-ff.
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 its influence on their separate research today. They also …
Karen A. Frenkel
Pages 214-222
