Abstract: In the first part of my talk, I consider the following problem arising in data privacy.

Abstract: In 1971, Graham and Pollak showed that if $D_T$ is the distance matrix of a tree $T$ on $n$ nodes, then $\det(D_T)$ depends only on $n$, not $T$.

Abstract: Decision trees form a basic model of computation, with connections to many areas in complexity and approximation theory.

Abstract: In this talk, we introduce a formal framework for analyzing trades in financial markets. An exchange is where multiple buyers and sellers participate to trade.

Abstract: Recently there has been a great interest in the analytic understanding of the behavior of large server systems with randomized routing.