Abstract: In a multi-armed bandit problem a gambler needs to choose at each round one of K arms, each characterized by an unknown reward distribution.

Abstract: This talk will comprise of two parts. In the first half, I shall discuss about Reed-Muller Codes and Reed-Solomon Codes. Basically, we shall prove that Reed-Muller Codes are a subset of Reed-Solomon Codes.

Abstract: The advent of big data necessitated design of algorithms that could cope with it.  Streaming algorithms are viable for big data because they process their input sequentially and use a small amount of working memory.  In

Abstract: Reachability and strong-connectivity are some of the fundamental graph problems. In the static setting, both problems can be solved in O(m+n) time for any directed graph G with n vertices and m edges.