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

Abstract: In the 1980s, Kaltofen proved one of the most remarkable results in algebraic complexity theory.

Abstract:   For a class of polynomials P,  a set of evaluation points H is said to be a hitting set if any nonzero polynomial P is nonzero on some point in H.

Abstract: In this talk we shall see a strategy to achieve the best rate possible for the point-to-point channel with eavesdropper (while maintaining secrecy),  in the one-shot regime.