The project titles are tentative, based on what has been proposed by
email or in limited discussions. They may be revised after receiving
your preliminary reports.
- Greg Buhler, Matthew Goodyear, Alexander Horwatt, Noboru Obata,
Eunyoung Seol, A splay tree implementation of the std::map
container
- Anand Balan, Ruchi Dayal, Omesh Tickoo, A generic
algorithm for finding long paths in a graph
- Yebin Luo, Rui Mu, Jiahe Si, Hua Yang, Ki Yim, A generic
Floyd-Warshall algorithm for the all-pairs shortest paths problem
- Niharika Mateti, Chandrika Palagiri, Saroj Yadav, A
generic path problem solver for directed graphs
- Bill Katt, JJ Johns, Mike LaSpina, Matt Schumaker, Jeremy Shute,
Generic networked IO
- Jing Han, Kewei Huang, Yu Shao, Jianliang Yi, Maximum
cardinality matching in general graphs
- Vikram Agrawal, Jitendra Deshpande, Yogesh Girdhar, Adnan
Saifee, Generic planar graph algorithms
- Mital Chandihok, Scott Hunter, Kevin Ring, Heterogeneous
containers
Tuesday, November 6 | 10:00 - 10:40am | Team 6 |
. | 10:40 - 11:20am | Team 3 |
Wednesday, November 7 | 10:40 - 11:20am | Team 2 |
Thursday, November 8 | 10:00 - 10:40am | Team 8 |
. | 10:40 - 11:20am | Team 7 |
. | 2:00 - 2:40pm | Team 4 |
Friday, November 9 | 10:00 - 10:40am | Team 5 |
. | 10:40 - 11:20am | Team 1 |
|
These meetings will be held in my office, Lally 313,
or in Lally 311. If both doors are closed, knock on
my office door first.
All members of the team must attend the meeting.
|