Aug 2018 – Dec 2018 · 4 mos · Atlanta, Georgia

• Course: Computer Networks (CS 3251) by Prof. Constantine Dovrolis
• Responsibilities: Assisting Prof. in preparing assignments, grading assignments, holding office hours and answering questions posted by students on online forums like Piazza. Managing other TAs in the class and coordinating with Prof and the TAs.

Jan 2018 – May 2018 · 4 mos

• Course: Computer Networks (CS 3251) by Prof. Constantine Dovrolis
• Responsibilities: Assisting Prof. in preparing assignments, grading assignments, holding office hours and answering questions posted by students on online forums like Piazza.

May 2018 – Aug 2018 · 3 mos · San Francisco Bay Area

• Designed and implemented a stateless distributed notification system for proactive monitoring.
• The notification system serves about 750+ users, improving their productivity.
• Made a critical termination call asynchronous, leading to improved reliability and cost-savings.

Jul 2015 – Jul 2017 · 2 yrs · Bengaluru Area, India

• Hands-on experience of working with a large-scale distributed ETL system.
• Built an Azure Web API for the Middle-Tier serving up to 100,000 queries every hour.
• Implemented asynchronous APIs and SQL indexes resulting in 5x speedup.
• Designed and implemented a secure password management system and a live-site tracking system for the team’s use-cases.

May 2014 – Jul 2014 · 2 mos · Bengaluru Area, India

• Built an equivalent in-memory tabular model for a multidimensional cube. Performed thorough analysis of the compared working of the two.
• The model built proved to respond to queries faster than the cube. The model, however, did not support some of the key functionalities that the cube would support for real-time use.

Jun 2013 – Aug 2013 · 2 mos · Bengaluru Area, India

• Worked as an intern under Prof. Y. Narahari in the Computer Science and Automation department, IISc, Bangalore. The intern project was on Social Network Analysis.
• In the project 'Experimental analysis on Influence Coverage in Social Networks', we experimented and analysed various existing NP-hard algorithms. We orchestrated greedy techniques and analysed them against the existing algorithms to see an improvement in the performance.
• We presented a paper about our findings in the Paper Presentation competition held in SJCE, Mysore. We were awarded the best paper award.