Linda L. Deneen

According to our database, Linda L. Deneen authored at least 7 papers between 1987 and 1994.

Collaborative distances:

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

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

Development and documentation of computer programs in undergraduate computer science programs.

Linda L. Deneen, Keith R. Pierce

Proceedings of the 19th SIGCSE Technical Symposium on Computer Science Education, 1988

1987

The contour model as an instructional tool in elementary computer science courses.

Linda L. Deneen

Proceedings of the 18th SIGCSE Technical Symposium on Computer Science Education, 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