Talks

1. 'A near-optimal execution policy for demand response contracts in electricity market' , 13th October, 2014, Columbia University (A presentation on Goyal-Iyengar-Qiu's work on an FPTAS for the execution of demand response contracts)

2. 'An O(log n/log log n) randomized approximation algorithm for the ATSP' , 1st April, 2014,

Columbia University (A presentation on the work of Asadpour et. al on the Asymmetric TSP) ( slides )

3. ‘On the boundedness of communication complexity by square root of rank’, 4th December, 2013, Columbia University (An overview of the recent work of Lovett on the Log-Rank conjecture) ( slides )

4. ‘Complexity Theory : What is it and the P-NP problem’, IFNA WCNA 2012, Athens, Greece, 25th June- 1st July (abstract accepted)

5. ‘Introduction to Complexity Theory’, Guest Lecture, ACM INFOTREK 2012, NIT Trichy, 18th March, 2012

6. 'Algorithms: An overview ', (Invited Speaker), Vortex 2012 (CSE dept. annual event), NIT Trichy, 14th March, 2012

7. ‘Support Vector Machines : An overview and its use in text information retrieval’, (Invited Speaker), National Seminar on Semantic Information Retrieval, NIT Trichy ,30th January,2012