|
Dartmouth College Computer Science Technical Report series |
CS home TR home TR search TR listserv |
| By author: | A B C D E F G H I J K L M N O P Q R S T U V W X Y Z | |
| By number: | 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986 | |
DCS-TR86-113: A Collection of MDS Example Programs
PCS-TR86-130: Finding Largest Empty Circles with Location Constraints
PCS-TR86-132: Voronoi Diagrams Based on Convex Distance Functions
PCS-TR86-134: Producing Software Using Tools in a Workstation Environment
PCS-TR92-176: Parallel Computer Needs at Dartmouth College
PCS-TR92-184: Building Segment Trees in Parallel
PCS-TR94-215: Fast Greedy Triangulation Algorithms
TR2005-538: An O(n^{5/2} log n) Algorithm for the Rectilinear Minimum Link-Distance Problem in Three Dimensions (Extended Abstract)
TR2005-546: Boolean operations with two dimensional segment trees
Notify me about new tech reports.

To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Technical reports collection maintained by David Kotz.