Linda L. Deneen

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	1994
j3		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
j2		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)
c4		Keith R. Pierce, Linda L. Deneen, Gary M. Shute: Teaching Software Design in the Freshman Year. CSEE 1991: 219-231
	1988
j1		Linda L. Deneen, Gary M. Shute: Polygonizations of Point Sets in the Plane. Discrete & Computational Geometry 3: 77-87 (1988)
c3		Linda L. Deneen, Keith R. Pierce: Development and documentation of computer programs in undergraduate computer science programs. SIGCSE 1988: 17-21
	1987
c2		Clark D. Thomborson, Linda L. Deneen, Gary M. Shute: Computing a Rectilinear Steiner Minimal Tree in n^O(sqrt(n)) Time. Parallel Algorithms and Architectures 1987: 176-183
c1		Linda L. Deneen: The contour model as an instructional tool in elementary computer science courses. SIGCSE 1987: 170-178

Coauthor Index

1	Keith R. Pierce	[c4] [c3]
2	Gary M. Shute	[j3] [j2] [c4] [j1] [c2]
3	Clark D. Thomborson (Clark D. Thompson)	[j3] [j2] [c2]

Last update Mon May 20 07:41:02 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page