From the description:
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.
The course page has links to similar courses.
For hardy souls exploring data structures per se or for specialized topic maps, an annotated bibliography of readings.
If you haven’t seen it, visit Jeff’s homepage.
To see what Jeff has been up to lately: DBLP: Jeff Erickson.