COS350 2009 Spring Semester
Project Assignments

Based on the Stonybrook Algorithm Repository, constructed by Steven Skiena, and the NIST (National Institute of Standards and Technology) Dictionary of Algorithms and Data Structures.
Teams
Projects
John Christianson
Eric Payne
Jered Philippon
Longest Common Substring(1.7.8), Eulerian Cycle/Chinese Postman (1.4.7), Clique (1.5.1)
Tim Baker
William Lamond
Jason Rhoda
Text Compression (1.7.5), Drawing Trees (1.4.11), Edge Coloring (1.5.8)
Tom Gagnon
Eric Volkernick
Charles Toothacker
Davis Walsh
Shortest Common Substring(1.7.9), Cryptography(1.7.6), Graph Isomorphism (1.5.9)
Michael Hutchinson
Sangam Lama
Kelly White
String Matching(1.7.3),Satisfiability (1.3.10),Vertex Cover (1.5.3)
Dan Ciaburri
Ovo Dibie
Ed Ropple
Approximate String Matching (1.7.4)Triangulation (1.6.3), Traveling Salesman Problem (1.5.4)

Last Updated: 1/21/09
Larry Latour
University of Maine Department of Computer Science

Back to COS350 Main Page