• Course description.

  Research in algorithms and data structures, such as for computational geometry, graph algorithms, sorting, external-memory algorithms, and parallel algorithms.

• Coursework.

  Coursework consists of regular meetings with Dr. Goodrich, data gathering, design of algorithms, experimental and/or mathematical analysis of algorithms, and paper writing. The course grade will be determined based on performance of coursework.

Note: The work for this course cannot also count as work for a Graduate Student Researcher (GSR) position during the same quarter.