| 1994 |
|---|
| 7 | | Linda L. Deneen,
Gary M. Shute,
Clark D. Thomborson:
A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees.
Random Struct. Algorithms 5(4): 535-558 (1994) |
| 1991 |
|---|
| 6 | | Keith R. Pierce,
Linda L. Deneen,
Gary M. Shute:
Teaching Software Design in the Freshman Year.
CSEE 1991: 219-231 |
| 5 | | Gary M. Shute,
Linda L. Deneen,
Clark D. Thomborson:
An O(n log n) Plane-Sweep Algorithm for L_1 and L_\infty Delaunay Triangulations.
Algorithmica 6(2): 207-221 (1991) |
| 1988 |
|---|
| 4 | EE | Linda L. Deneen,
Keith R. Pierce:
Development and documentation of computer programs in undergraduate computer science programs.
SIGCSE 1988: 17-21 |
| 3 | | Linda L. Deneen,
Gary M. Shute:
Polygonizations of Point Sets in the Plane.
Discrete & Computational Geometry 3: 77-87 (1988) |
| 1987 |
|---|
| 2 | | Clark D. Thomborson,
Linda L. Deneen,
Gary M. Shute:
Computing a Rectilinear Steiner Minimal Tree in nO(sqrt(n)) Time.
Parallel Algorithms and Architectures 1987: 176-183 |
| 1 | EE | Linda L. Deneen:
The contour model as an instructional tool in elementary computer science courses.
SIGCSE 1987: 170-178 |
