Mohit Garg

Course Calendar (STCS) for Aug-Dec 2009 can be found here
Information Theory (Winter '09) offered by Jaikumar Radhakrishnan.
Mathematical Finance (Spring '09) offered by Sandeep Juneja.
Derandomization (Spring '09) offered by Jaikumar Radhakrishnan.
Links: David Zukerman's notes (lecture 6, 7 important), Cynthia Dwork and Prahladh Harsha's notes on expanders, Expander survey by Hoory, Linial and Wigderson
Quantum Information Processing (Spring '09) offered by Naresh Sharma
Mathematical Structures (Autumn '08) offered by Jaikumar Radhakrishnan

Links to some of the websites that I have designed and am maintaining (this is just a hobby):

Homi Bhabha Birth Centenary Commemoration: Site is running since Feburary 14, 2009.
Govt. College of Engineering and Leather Technology: I designed this site when I was in final year (2007) of my BTech. I'm still maintaining it
NAQC 2008

Some of the conferences that I attended

FSTTCS '09 (Dec 15-17, 2009, IIT Kanpur)
Young Indian Scientists Colloquium: Homi Bhabha Birth Centenary Event (Sept 7-10, 2009, TIFR, Mumbai)
Dr. Homi J. Bhabha Birth Centenary Workshop on Stochastic Methods: Analysis and Algorithms (Sept 2-5, 2009, TIFR, Mumbai)
Graphical Models, Statistical Inference and Algorithms (Jan 5-9, 2009, TIFR, Mumbai)
FSTTCS '08 (December 9-11, 2008, IISc, Bangalore)
DASFAA '08 (March 19-21, 2008, India International Center, New Delhi)

(talks where venue is not mentioned are given at TIFR)

Couting Binary Trees (slides) (Jan 6, 2010): Winter workshop at GCELT
HJM Term Structure Model (slides) (Aug 13, 2009): This was a part of the Mathematical Finance course
The Dinitz Problem (May 8, 2009) at the Student's seminar
Of Friends and Politicians (slides) (March 19, 2009) at the STCS Annual Symposium 2009
Abstract: Suppose in a group of people, we have the situation that any pair of persons have precisely one common friend. Then there is always a person (the "politician") who is everybody's friend. In mathematical jargon, this is called friendship theorem. Several proofs of the friendship theorem exist, but the first proof, given by Paul Erd.s, AlfréRéi and Vera Sóis still the most accomplished. The proof is by contradiction and uses elementary combinatorics and linear algebra.
Frobenius Theorem (Jan 31, 2009): This was a part of the Mathematical Structures course.