Bryan Kocher
Pages 1251-1252
Bryan Kocher
Pages 1253-ff.
Peter J. Denning
Pages 1254-1255
For over two decades, software psychology researchers have been developing insights to software productivity and quality by investigating builders and users of software. This research has been diverse in both its approach and …
Ben Shneiderman, John M. Carroll
Pages 1256-1258
Conceptual representation methods play a significant role in facilitating the software process. Recent studies explore and clarify the use of these representations and their impact on progress.
Elliot Soloway, Robin Lampert, Stan Letovsky, David Littman, Jeannine Pinto
Pages 1259-1267
The problems of designing large software systems were studied through interviewing personnel from 17 large projects. A layered behavioral model is used to analyze how three of these problems—the thin spread of application domain …
Bill Curtis, Herb Krasner, Neil Iscoe
Pages 1268-1287
Software tools that support the design and development of interactive computing systems are an exciting possibility. The potential pay-off is great: user interface management systems, for example, promise not only to speed the …
Mary Beth Rosson, Wendy Kellogg, Susanne Maass
Pages 1288-1298
An analogy between proving mathematical theorems and designing computer algorithms provides an elegant methodology for designing algorithms, explaining their behavior, and understanding their key ideas.
Udi Manber
Pages 1300-1313
A new contour generating serial algorithm is faster and more efficient than conventional contour tracing and parallel algorithms
Paul Kwok
Pages 1314-1324
Clifford A. Pickover
Pages 1326-1329
Three algorithms for sampling from exponential, Cauchy and normal distributions are developed. They are based on the "exact approximation" method, and their expected numbers of consumed uniform deviates are less than 1.04 per …
Joachim H. Ahrens, Ulrich Dieter
Pages 1330-1337
The number of buffers required for sequential processing of disk files is investigated with the assumption that there is a single user served by two processors: one reads blocks from the disk into buffers in main memory, while …
Alon Itai, Yoav Raz
Pages 1338-1342
The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap—a sequence of m decrease_key and n delete_min operations takes time O(m + n log n). A variant of relaxed heaps …
James R. Driscoll, Harold N. Gabow, Ruth Shrairman, Robert E. Tarjan
Pages 1343-1354
