Previous Conferences & Workshops

We will discuss results connecting the titular objects on infinite graphs, including some known results by Varopoulos and Coulhon and Saloff-Coste and some new resutls.

A classical theorem of Edmonds provides a min-max formula relating the maximal size of a set in the intersection of two matroids to a ``covering" parameter. In this talk we generalize this theorem, replacing one of the matroids by a general...

We will describe definitions and algorithmic results for the ``census problem''. Informally, in a census individual respondents give private information to a trusted (and trustworthy) party, who publishes a sanitized version of the data. There are...