The algorithms seminar group is a collection of students and professors that meets weekly to discuss algorithms. During each meeting a member of the group gives a 1-1.5 hour lecture. Typically, we present recent results found in conference proceedings, journals, from our own research, or by visiting researchers.
Any student or professor with an interest in algorithms is encouraged to attend. The schedule is as follows. (We also have an archive of the seminars in 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011.)
| Date | Speaker | Topic |
|---|---|---|
| 2012-09-07, 11:00 | Christian Scheffer | Manifolds in R3 |
| 2012-07-20, 11:00 | Nima Hoda | Moser's entropy compression technique |
| 2012-06-08, 11:00 | Stefanie Wuhrer | Posture-invariant statistical shape analysis using Laplace operator |
| 2012-06-01, 11:00 | John Iacono | Using hashing to solve the dictionary problem (in external memory) |
| 2012-05-31, 11:00 | Jason Morrison | Robust non-parametric data approximation of pointsets via data reduction |
| 2012-04-27, 11:00 | Pat Morin | Robust geometric spanners |
| 2012-04-20, 13:00 | Aritra Banik | A survey on the discrete Voronoi game |
| 2012-04-13, 13:00 | Jasine Babu | An approximation algorithm for the boxicity of circular arc graphs |
| 2012-03-30, 11:00 | Bodhayan Roy | Point visibility graphs |
| 2012-03-23, 11:00 | Michiel Smid | Dumbell trees, Part B |
| 2012-03-16, 11:00 | Michiel Smid | Dumbell trees, Part I |
| 2012-03-09, 11:00 | Jit Bose | The stretch factor of L1- and L∞-Delaunay triangulations |
| 2012-02-17, 11:00 | Pat Morin | Interference |
| 2012-02-03, 11:00 | Bob Fraser | The discrete unit disk cover problem |
| 2012-01-27, 11:00 | Matthew Eastman | Aperiodic tilings |
| 2012-01-20, 11:00 | Dan Chen | On approximate range counting and depth |