Computing a Rectilinear Steiner Minimal Tree in nO(sqrt(n)) Time. - Clark D. Thomborson; Linda L. Deneen; Gary M. Shute (Parallel Algorithms and Architectures, 1987)

Polygonizations of Point Sets in the Plane. - Linda L. Deneen; Gary M. Shute (Discret. Comput. Geom., 1988)

Teaching Software Design in the Freshman Year. - Keith R. Pierce; Linda L. Deneen; Gary M. Shute (CSEE, 1991)

An O(n log n) Plane-Sweep Algorithm for L_1 and L_ infty Delaunay Triangulations. - Gary M. Shute; Linda L. Deneen; Clark D. Thomborson (Algorithmica, 1991)

A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees. - Linda L. Deneen; Gary M. Shute; Clark D. Thomborson (Random Struct. Algorithms, 1994)

Book Reviews: George Lakoff and Rafael E. Núñez, Where Mathematics Comes From, New York: Basic Books, 2000, xvii+493 pp., $30.00, ISBN 0-46503-770-4. - Gary M. Shute (Minds Mach., 2005)

Abstraction in Computer Science. - Timothy R. Colburn; Gary M. Shute (Minds Mach., 2007)

Metaphor in computer science. - Timothy R. Colburn; Gary M. Shute (J. Appl. Log., 2008)

Decoupling as a Fundamental Value of Computer Science. - Timothy R. Colburn; Gary M. Shute (Minds Mach., 2011)