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.)
Date |
Speaker |
Topic |
2009-11-27, 11:00 |
David Kirkpatrick |
Hyperbolic dovetailing |
2009-10-22, 11:00 |
Pat Morin |
On the expected maximum degree of Gabriel and Yao graphs |
2009-10-01, 11:00 |
Adrian Dumitrescu |
Long non-crossing configurations in the plane |
2009-09-24, 11:00 |
Michiel Smid |
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension |
2009-09-17, 11:00 |
Pat Morin |
Constructive Proof of the Lovasz Local Lemma |
2009-09-16, 10:00 |
Dan Halperin |
The Road Not (Yet) Taken: New Tools for Extremal Path Planning |
2009-08-26, 13:30 |
Drew Martin |
Binary Search Trees |
2009-08-12, 14:00 |
John Howat |
A Distribution-Sensitive Dictionary with Low Space Overhead |
2009-08-12, 13:30 |
Karim Douieb |
Efficient Construction of Near-Optimal Binary and Multiway Search Trees |
2009-07-15, 13:30 |
John Iacono |
The Geometry of Binary Search Trees |
2009-07-08, 13:30 |
Christian Wulff-Nilsen |
Wiener Index, Diameter, and Stretch Factor of a Planar Graph in Subquadratic Time |
2009-05-20, 13:30 |
Dana Jansens |
Visualizing Chan's Divide and Conquer 3-d Convex Hull Algorithm |
2009-05-13, 13:30 |
Norbert Zeh |
New Results on (Cache-Oblivious) Range Searching |
2009-04-29, 13:30 |
Ben Seamone |
Graph Spanners |
2009-04-22, 13:30 |
Karim Douieb |
Quake Heaps: a simple alternative to Fibonacci heaps |
2009-04-17, 10:30 |
Hamid Zarrabi-Zadeh |
Geometric Approximation Using Coresets |
2009-04-08, 14:30 |
Michiel Smid |
Vitali's construction of doubling a disk |
2009-03-11, 14:30 |
Vida Dujmovic |
Biased Range Trees |
2009-03-4, 14:30 |
John Howat |
(Mis)applications of randomization to sorting: slower than slow |
2009-02-25, 14:30 |
Paz Carmi |
Bounding the Locality of Distributed Routing Algorithms |
2009-02-13, 13:30 |
Jack Snoeyink |
Degree-driven algorithm design: reduced precision computation of the Voronoi diagram |
2009-02-04, 14:30 |
Greg Aloupis |
Reconfiguring Modular Robots |
2009-01-28, 14:30 |
Jit Bose |
On various properties of polygons and some consequences of these properties |
2009-01-14, 14:30 |
Jamie King |
Random Hyperplane Search Trees |