Date:    Monday March 1, 4:30pm
Speaker: Herve Bronnimann

Title: Analyzing the IDAG (=influence graph)

Abstract:

We'll explore a variant of the formalism of Clarkson and Shor for
randomize incremental algorithms. The framework allows the insertion of
objects belonging to a universe, and maintains the set of regions that
are defined but do not conflict with the objects. Examples in a
traditional setting include sorting, and in computational geometry
include many algorithms like triangulation/trapezoidal map, convex
hulls, etc.  The algorithm uses an influence graph (IDAG), which is a
directed acyclic graph (DAG) storing regions at the nodes. We will prove
a very powerful theorem that allows to analyze the performance of the
IDAG under a random order of insertions for the objects.
If time permits, we will look at deletions as well as insertions.