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: Given n jobs with release dates, deadlines and processing times we consider the problem of scheduling them on m parallel machines so as to minimize the total energy consumed.

The field of Learning Theory has witnessed an explosive growth over the past decade.

Abstract: We are in the midst of a major data revolution. The total data generated by humans from the dawn of civilization until the turn of the new millennium is now being generated every other day.

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