Mohit Garg
Research Scholar
STCS, TIFR
Room No. A212
Phone: 022-22782912
email: garg[at]tifr[dot]res[dot]in
Search TIFR
Some of the courses at TIFR
TIFR Mania
- Pictures of TIFR (taken by KP Singh) on Picasa
- Photographs taken in and around TIFR on flickr (not by me)
Web development
Links to some of the websites that I have designed and am maintaining (this is just a hobby):
Conferences attended
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
(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.
Articles, FAQ, Blogs