Abstract: Given a graph $G$ with one source vertex $s$ and several target vertices, a shortest path tree rooted at $s$ is a subgraph of $G$ that preserves distances from $s$ to each of the target vertices.

Abstract: In a breakthrough, Hastings(2009) showed that there exists quantum channels whose classical Holevo capacity is superadditive i.e.

Abstract: The first observation that one makes when analyzing communication protocols between Alice and Bob is that a cost c protocol partitions the input space into 2^c combinatorial rectangles.

Abstract: In December 2001, David Moews held a programming contest to see whose short C program would return the largest number on a theoretical computer where the int datatype has no bounds.

Abstract: In this talk, we will state an prove the Minkowski's convex body theorem and see how it can be applied to prove Dirichlet's theorem on (simultaneous) diophantine approximation and to prove the fact that if p is prime wit