CSEP 521

Spring Quarter 2005

Class Project Titles

Hema Alaganandam and Damodar Nagapuram: External memory sorting algorithms

Bob Archer and Todd Detwiler: Graph drawing for hierarchies

Caleb Baker and Chuck Reeves: Public key generation algorithms

J. Christopher Bare: Fast sequence comparison algorithms in molecular biology

Michael Bosland: Public key encryption algorithms

Amlan Chakraborty: Call graph analysis algorithms

Robin Cole: Approximate string matching algorithms

David Coleman: Satisfiability algorithms

Holly Cosland: Collaborative filtering algorithm analysis

Marcelo De Barros: A survey of techniques to solve primality testing

Dave Driver and David Mortenson: Algorithms for code re-organization in order to optimize cache effectiveness

Andrea Eakin: Clustering of Gene Expression Data

Rajesh Iyer: Network flow algorithms

Mehmet Iyigun: Event prediction algorithms in computer systems

Ryan Kaminsky: Nearest neighbor search algorithms.

Eric Leonard: Surface reconstruction from polygons

Damon May: The N-body simulation problem

Shuvro Mazumder and Vaishnavi Sannidhanam: Comparison of satisfiablilty algorithms

Joanna Muench: Algebraic simplification

Grayson Myers: A comparison of sat solvers.

Sundaram Narayanan: Approximate string matching algorithms

Scott Nelson: Public key encryption algorithms

Leslie Ng and Gleb Krivosheev: A survey of web page ranking algorithms

Brian Ostergren: Optimizing construction of binary space partitioning trees

J. Chad Parry: Lock-free and wait-free algorithms

Arwen Pond: Algorithms for picking primes

Shankar Raghavan: Graph and tree drawing algorithms

Ryan Rule: Intersection detection algorithms

Lavina Thong: Algorithms for Chinese word segmentation

Koichi Tsunoda and D.G. Christensen: External sorting algorithms

James Welle: Analysis of splay trees and AVL trees

Elizabeth Wood: Approximate string matching algorithms

Man Xiong : External memory sorting

Song Xue: Algorithms for web page authority

Eiman Zolfaghari: Ad hoc routing algorithms.