Abstract: The communication class UPP^{cc} is a communication analog of the Turing Machine complexity class PP.

Abstract: Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. In the classical model, each player selects a path connecting her source and target vertices.

Abstract: Data has been growing at an unprecedented rate in the last few years.

Abstract: We study the extremes of branching random walks under the assumption that underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or have lighter tails.

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