Siddharth Subramanian

Contact Information

Mobile: +1-512-705-3088 E-mail: mitsiddharth@gmail.com Website: http://is.gd/siddharths University of Texas at Austin M.S. Computer Science August 2011 present CGPA : 3.89/4 Relevant courses : Graduate Algorithms, Text processing with Mapreduce, Machine learning, Applied text analysis, Neural networks, Software for multicore processors Anna University B.E. Computer Science August 2005 May 2009 CGPA : 9.4/10 Ranked 1 out of 70, University Gold Medalist Relevant courses : Algorithms, Compilers, Theory of Computation, Graph Theory, Computer Architecture, Operating Systems

Education

Professional Experience

Google, Mountain View, CA, USA Software Engineering Intern May 2012 August 2012 Worked in Adwords Backend team, making improvements to Budgeting infrastructure. Implemented a feature in Budget Server/Controller, which is currently running on production servers. Microsoft R&D Pvt. Ltd, Hyderabad, India Software Development Engineer October 2009 July 2011 Worked in various feature areas in CRM Team including SharePoint Collaboration, E-mail and Data Management. Used various technologies in web development like C#, ASP.NET, Script#, MS SQL, Javascript. Google, Hyderabad, India Software Engineering Intern May 2008 August 2008 Worked on reducing the time taken to process and query billions of logs generated by the Postini mail server that was used for corporate purposes. Used MapReduce and other Google Technologies to reduce the time taken to process the logs from days to a few hours.

Academic Projects

Language dierences in Twitter Collected tweets from India and US regions and analyzed the dierences in the type of English used by people from these regions. This was done as part of Map-Reduce course. Topic modeling was used to identify common topics. Within these topics, the words used by Americans and Indians were observed and salient terms used in these variants of English were identied. Ecient Algorithms to solve the Broadcast Scheduling problem in wireless networks Proposed two approaches to solve the broadcast scheduling problem, which is NP-Complete. The rst one was a Dynamic programming approach, which is suitable for smaller networks, and the other one was an evolutionary algorithm (Genetic Algorithm) which produced good results for larger networks. Anomaly Based Intrusion Detection System Designed an intrusion detection system using the advantages of Bayesian classier and clustering techniques, which is ecient and accurate. It was tested with KDD Cup 1999 dataset by supplying it with a good training set and a minimal one. In the rst case, it produced excellent results, while in the second case it gave consistent performance. Chess Implemented Chess program using Articial Intelligence and GUI features. The program had 3 levels of diculty (Easy / Medium / Hard) for the user to play against the computer. Used various AI techniques and pruning methods. This was done during the third semester for Object Oriented Programming.

Automated Judge for Programming competitions Created an automated judge for intra-college programming competitions. The project was implemented using java. Used concepts like threading, sockets and java swing for Graphical User Interface. The automated judge can be used in LAN environments and is used to execute the programs submitted by the contestants, evaluate them, and update the result of each submission automatically.

Selected Publications

Gunasekaran R, Siddharth S, Krishnaraj P, Kalaiarasan M, Dr Rhymend Uthariaraj V, Ecient algorithms to solve Broadcast Scheduling problem in WiMAX mesh networks, Computer Communications Journal, Elsevier, Volume 33 Issue 11, July, 2010. Dr Thamarai Selvi S, Srivathsan R, Imayavendhan J, Raghavan Muthuregunathan, Siddharth S, Combining Naive-Bayesian Classier and Genetic Clustering for Eective Anomaly Based Intrusion Detection, RSFDGrC 09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, Vol. 5908, pp. 455-462, 2009. Srivathsan R, Siddharth S, Raghavan Muthuregunathan, Gunasekaran R, Rhymend Uthariaraj, Enhanced Genetic Algorithm for solving Broadcast Scheduling problem in TDMA based wireless networks, COMSNETS10 Proceedings of the 2nd international conference on COMmunication systems and NETworks, pp. 387-396, 2010. Gunasekaran R., Siddharth S., Raghavan Muthuregunathan, Srivathsan R., V.R. Uthariaraj, An Improved Parallel Genetic Algorithm for Path Bandwidth Calculation in TDMA-Based Mobile Ad Hoc Networks, act, pp.220-226, 2009 International Conference on Advances in Computing, Control, and Telecommunication Technologies, 2009

Achievements

Ranked 4th in ACM ICPC 2008, Asia Regionals held at Amrita Vishwa Vidyapeetham, Amritapuri. Team - CSpirit Ranked 5th in ACM ICPC 2008, Asia Regionals held at IIT Kanpur. We were 2nd amongst the Indian teams that participated in that contest. Team - CSpirit. Ranked 8th in ACM ICPC 2006, Asia Regionals held at Amrita Vishwa Vidyapeetham, Coimbatore. I was in 2nd year when I attended this contest. Team - CSpirit Participated in many Topcoder programming competitions. Achieved a personal maximum rating of 1374. In a topcoder competition, I was ranked 2nd out of around 800 international coders. Solved more than 300 problems from ACM UVA online judge. I am ranked among the top 10 Indian coders in that online judge. Won 1st place in theACM Coding Contest South India Level 2007, which was an online programming contest held by Amrita Vishwa Vidyapeetham, Amritapuri Won Consolation prize (ranked among the top 10 teams) in ACM Multi Provincial Programming Contest, held at IIT Kharaghpur. Won consolation prize (10th rank) in Advanced Programming Contest in SHAASTRA 2007 hosted by IIT Madras. Won a lot of programming (more than 15) and debugging contests in many technical competitions at college-level

Joint Secretary of the IT Association (2006) , MIT , Anna University

College Activities and Leadership

Organizer of various programming and debugging contests in our college. Some of them are: Samhita 2007 and 2008 (onsite and online programming contests) Carte Blanche 2009 (debugging contest) Problem setter for competitions hosted by our college. A few problems have also been archived in ACM UVA online judge. The Online Code Hunt competition was part of Samhita 2009, which was organized by me. The competition was attended by top coders from many countries (Hong Kong, Russia etc.) and got good feedback for the quality of the problems from many contestants.