Algorithms Seminar in 2011

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.)

Date | Speaker | Topic |
---|---|---|

2011-12-09, 11:00 | Jean-Lou de Carufel | Everything you always wanted to know about polynomial equation solving (but were afraid to ask) |

2011-11-25, 11:00 | Prosenjit Bose | Every 4-connect planar graph has a Hamiltonian cycle |

2011-11-18, 11:00 | Carsten Grimm | Multiple-source shortest paths in planar graphs |

2011-11-11, 11:00 | Sander Verdonschot | Monte-Carlo tree search in computer Go |

2011-10-28, 11:00 | John Howat | Biased predecessor search |

2011-10-21, 11:00 | André van Renssen | On plane bounded-degree spanners |

2011-10-14, 11:00 | Anil Maheshwari | Minimum spanning trees |

2011-09-30, 11:00 | Stephane Durocher | Linear-space data structures for range mode query in arrays |

2011-09-23, 13:00 | Lino Demasi | Rooted minors and delta wye transformations |

2011-09-16, 11:00 | Michiel Smid | An Ω(nlog n) lower bound for computing the sum
of even-ranked elements |

2011-08-30, 11:00 | Summer Students | TBA |

2011-08-23, 11:00 | Carsten Grimm | The flow path problem |

2011-08-02, 11:00 | Several speakers | CCCG practice talks |

2011-07-26, 11:00 | Andre van Renssen | Competitive routing in the half-θ_{6}-graph |

2011-07-19, 11:00 | Dan Chen | Algorithms for bivariate majority depth |

2011-07-12, 11:00 | Christian Wulff-Nilsen | Distance oracles with near-linear preprocessing time for undirected graphs |

2011-07-05, 11:00 | John Howat | Range queries on grids |

2011-06-28, 11:00 | Dana Jansens | Efficient delta-universal and strongly-universal hashing |

2011-06-21, 11:00 | Sander Verdonschott | Making triangulations 4-connected using flips |

2011-06-14, 11:00 | Rolf Fagerberg | Some new results on the dynamic optimality problem |

2011-06-07, 11:00 | Jit Bose | Short Proofs of Kuratowski's and Fáry's Theorems |

2011-05-31, 11:00 | Michiel Smid | Colored range searching |

2011-05-24, 11:00 | Pat Morin | An overview of practical and provably good hash functions |

2011-02-09, 11:00 | Michiel Smid | A randomized construction of fault-tolerant spanners |

2011-01-04, 11:00 | Svetlana Stolpner | Medial axis for shape representation |