CS 598 JGE: Advanced Data Structures (Fall 2015)

Jeff Erickson
WF 2:00–3:15, 317 Gregory Hall
Office hours: TTh 11-12, 3304 Siebel Center

   Announcements    Schedule    Projects   


December 13
Thanks to an unexpected scheduling conflict, Tuesday's project presentations will start at 2:30 instead of 2:00. Sorry for the late notice.

Please come as early as possible on your chosen presentation day (10am Monday, 2:30 Tuesday, or 2:00 Wednesday) and if possible, stay until that day's presentations are done. The presentations will be much more rewarding for everyone if there's an audience!

December 9
Based on feedback from the previous Doodle poll, we will hold project presentations at the following times: Each group has 20 minutes to present, so in principle, we have enough time for 18 project presentations. However, we can run to 5:00 on Tuesday and Wednesday if absolutely necessary.

Please register your group by filling out this Doodle poll no later than Friday, December 11. Please send Jeff email as soon as possible if your group cannot present at any of the available times.

December 5
We will hold project presentations during finals week. Each project group will have 20 minutes to present their project. Each group can delegate any non-empty subset to give their presentation, but all group members must attend. Questions from the audience are strongly encouraged. 20 minutes is a lot less time that you think, especially if you've never given a presentation before. I strongly recommend practicing your presentations, with at least three complete dry runs, before giving the real thing.

Please fill out this Doodle poll to let me know when your group is available and willing to present. Each group should fill out the form once; enter the names of all group members, and only select times that the entire group can be present. Given the likely number of projects, we will need> at least three two-hour meetings to get through them all.

Written project reports are due Friday, December 18.

December 1
I will distribute ICES forms at the end of class on Wednesday, December 9.

November 17
All submitted project proposals are available in a password-protected directory. I will announce the username and password in class tomorrow.

October 26
I will hold the first of several makeup lectures this afternoon, from 2:00 to 3:15, in 1109 Siebel Center. Later makeup lectures will be on different days of the week, so hopefully most students can come to most of the makeup lectures.

October 21
Homework 3 is due next Wednesday, November 4.

Friday's lecture (October 23) will end at 2:45, so that everyone can attend Andrew Yao's 3:00 lecture.

The first makeup lecture will be next Monday, October 26, 2:00-3:15. I'll announce the location (most likely in Siebel) by the end of the week.

October 6
Homework 2 is due next Friday, October 14. Starting with this homework, I plan to release one or two homework problems a week, each due roughly two weeks after release. In weeks where I release two problems (like this one), you only need to submit solutions for one of them.

I am traveling all next week, so class will be canceled; I will also miss two more lectures later in the semester. I've created a Doodle poll to help schedule a time for makeup lectures; please fill out the survey as soon as possible. Thanks!

September 28
Homework 1 has been revised again (and LaTeX source has been updated) to fix problem 4. Sigh. If you decide to submit problem 4, your solutions are due next Friday, October 10.

September 21
Homework 1 has been revised. The insertion algirithm in problem 1 is correct now. (I hope!) I've also added a fourth problem; each team should submit solutions for three of the four problems.

September 18
Homework 1 is due Friday, October 3, two weeks from today. LaTeX source for the homework is available.

All students who signed the waiting list have been offered registration overrides. If you are still interested but unable to add the class, please talk to Jeff as soon as possible.

August 26
Welcome! Please be patient; I'm still setting up this web site for the current semester.

As many of you have noticed, the class is full. Students who are still interested in taking the class are welcome to come to the lectures; I may be able to squeeze you in, especailly after a few people drop.

The class includes a significant number of undergraduates. Undergraduates are welcome, but please be aware that I will expect the same intellectual maturity, independence, and quality of work as graduate students in a top-5 computer science department.

About this class

This course will survey important developments in data structures that have not (yet) worked their way into the standard computer science curriculum. The precise topics will depend on the interests and background of the course participants; see the current schedule for details. Potential topics include include self-adjusting binary search trees, dynamic trees and graphs, persistent data structures, geometric data structures, kinetic data structures, I/O-efficient and cache-oblivious data structures, hash tables and Bloom filters, data structures that beat information-theoretic lower bounds, and applications of these data structures in computational geometry, combinatorial optimization, systems and networking, databases, and other areas of computer science.

Students in all areas of computer science and related disciplines are welcome, including algorithmically mature undergraduates. An undergrdauate algorithms class at the level of CS 473 is a prerequisite; specific background material will be introduced as needed.

Similar courses elsewhere

(This is list is out of date.)