Gary M. Shute

According to our database, Gary M. Shute authored at least 9 papers between 1987 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Decoupling as a Fundamental Value of Computer Science.

Timothy R. Colburn, Gary M. Shute

Minds Mach., 2011

2008

Metaphor in computer science.

Timothy R. Colburn, Gary M. Shute

J. Appl. Log., 2008

2007

Abstraction in Computer Science.

Timothy R. Colburn, Gary M. Shute

Minds Mach., 2007

2005

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

1994

A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees.

Linda L. Deneen, Gary M. Shute, Clark D. Thomborson

Random Struct. Algorithms, 1994

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

Teaching Software Design in the Freshman Year.

Keith R. Pierce, Linda L. Deneen, Gary M. Shute

Proceedings of the Software Engineering Education, 1991

1988

Polygonizations of Point Sets in the Plane.

Linda L. Deneen, Gary M. Shute

Discret. Comput. Geom., 1988

1987

Computing a Rectilinear Steiner Minimal Tree in n^O(sqrt(n)) Time.

Clark D. Thomborson, Linda L. Deneen, Gary M. Shute

Proceedings of the Parallel Algorithms and Architectures, 1987