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
- 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/was maintaining:
Conferences/Workshops
Some of the conferences/workshops that I attended
- India Theory Day 2012 (January 5, 2012, IISc, Bangalore)
- KRP75: Conference on Analysis (December 23-25, 2011, ISI Delhi)
- Data Structures Workshop (December 17-20, IMSc, Chennai)
- Breakthroughs in Theoretical Computer Science (December 15-16, 2011, IIT Bombay)
- FSTTCS '11 (December 12-14, 2011, IIT Bombay)
- Workshop on Pseudorandomness (Aug 22-25, 2011, CMI, Chennai)
- 2nd Annual Mysore Park Workshop in Theoretical Computer Science: Algorithms and Complexity (May 5-9, 2011, Infosys, Mysore)
- The 2011 School on Approximability (Jan 5-9, 2011, IISc, Bangalore)
- FSTTCS’10 (December 15-18, 2010, IMSc, Chennai)
- Mysore Park Workshop: Recent advances in Algorithms and Complexity (Oct 21-24, 2010, Infosys, Mysore)
- ICM Satellite (Aug 29-Sept 3, 2010, IISc, Bangalore)
- 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 presented at TIFR)
- Few Surprises From Combinatorics And Number Theory (Oct 31, 2011) at the Students' seminar
Abstract: Consider a natural number n. Let g denote the number of ones in the binary representation of n and h denote the greatest number such that two raised to h divides n!. Then, n=h+g. In this talk, we will prove the above and a few other 'surprising' results. (We also saw the proof of Bertrand's Postulate- there's always a prime in the interval (n,2n]).
- Random Regular Graphs: Generation and Cover time (slides, report) (Aug 3, 2011)
- Expanders: Application & Construction (slides) (April 9, 2010): STCS Annual Symposium 2010
- 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 Students' 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