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: A famous result of Ahlswede in the theory of Arbitrarily Varying Channels (AVCs) stated that the deterministic coding capacity of an AVC is either zero or is equal to its random coding capacity.

Abstract: In a recent breakthrough work Kasper Green Larsen, Omri Weinstein and Huacheng Yu [1] proved the first superlogartithmic lowerbound for a dynamic data structure problem.

Abstract:  The best known lower bound for general algebraic circuits was given by Baur and Strassen [BS83].

Abstract:  Linear loop programs are while programs with a linear loop condition and  linear assignments as loop body. In this talk we will discuss proof of decidability of a class of linear loop programs (due to A. Tiwari).