CS 573: Topics in Analysis of Algorithms (Spring 2006)
Advanced Data Structures

Main PageSchedule and Lecture NotesReferencesAdministrivia


Submitted Open Problems

About the Projects

Each student will submit an interesting, non-trivial, and preferably open problem related to data structures. Submitted problems need not be limited to the topics covered in class, but they must have some data-structure content. Experimental problems and problems related to your own primary research area are especially welcome. Above all, it should be a problem who solution you want to know but don't.

Before the end of the semester, teams of up to three students will submit solutions for a small subset of the submitted problems, preferably excluding their own. Students are encouraged to collaborate with anyone in or out of class (with proper credit, of course). Each team will also give a short oral presentation of their results.

The ideal result of the project is something that can be polished into a publishable paper. This ideal is meant to be an attractive goal, not an absolute requirement—not all research is successful! If you do not find a complete solution, your writeup and presentation should describe partial results, promising approaches for solving the problem(s), and ideas that looked promising but weren't (and why).

Hey, wait! How do we find good problems?

Excellent question! Here are a few hopefully useful suggestions. This list is nowhere near exhaustive, nor will every suggestion work equally well (or at all) for everybody. If you have other ideas for finding good research problems, I'd love to hear them!

Main PageSchedule and Lecture NotesReferencesAdministrivia