Nikhil S. Mande
I am a research scholar in the School of Technology and Computer Science at TIFR Mumbai and my advisor is Arkadev Chattopadhyay. A detailed bio can be found here.
I am currently looking for postdoc positions that start in Fall 2019.
I expect to graduate soon, and am looking forward to my next position (see update below)!
New: From December 2018 to September 2019, I will be a postdoc in the Department of Computer Science at Georgetown University, where Justin Thaler is hosting me.
- M.Sc. in Applications of Mathematics (with a specialization in Computational Mathematics) in 2013 from Chennai Mathematical Institute, Chennai
- Awarded CMI Gold Medal of Excellence.
- B.Math. (Hons.) in 2010 from Indian Statistical Institute, Bangalore
I am broadly interested in the area of computational complexity theory. More specifically, I have an interest in communication complexity, Boolean circuit complexity, and the connections between them.
Theses and projects
- New: My Ph.D. thesis is titled "Communication Complexity of XOR Functions". I will upload a version on this webpage in due course.
- Project as part of Ph.D. credits requirement titled "On the complexity of powering over finite fields in constant depth circuits" at TIFR under the guidance of Arkadev Chattopadhyay in Aug 2014-Feb 2015.
- Master's thesis titled "Spectral Graph Theory" at CMI under the guidance of Prajakta Nimbhorkar in Jan 2013 - Apr 2013.
- Project titled "Minimum variance hedging of American and European options using the binomial model" at TCS, Hyderabad under the guidance of M. Vidyasagar in the summer of 2009. Sponsored by the Indian Academy of Sciences.
- "A Short List of Equalities Induces Large Sign Rank", with Arkadev Chattopadhyay. In FOCS, 2018.
ECCC Report, Arxiv preprint, Slides.
- "A Lifting Theorem with Applications to Symmetric Functions", with Arkadev Chattopadhyay. FSTTCS, 2017.
- "Separation of Unbounded-Error Models in Multi-Party Communication Complexity", with Arkadev Chattopadhyay, 2016. To appear in Theory of Computing.
ECCC Report, Slides.
- New: "The Log-Approximate-Rank Conjecture is False", with Arkadev Chattopadhyay and Suhail Sherif, 2018.
- "Dual Polynomials and Communication Complexity of XOR Functions", with Arkadev Chattopadhyay, 2017. (This is an extended version of "A Lifting Theorem with Applications to Symmetric Functions").
ECCC Report, Arxiv preprint.
We have a weekly student seminar organized in our department. A list of past speakers, along with their titles and abstracts can be found here. Please do let me know if you work in an area that you feel might be of interest to our school, if you're dropping by TIFR and would like to give a student seminar here, I'll try to arrange something! Alternatively, you can contact Anamay, who is in charge of organizing the student seminars.
- I enjoy speedcubing. I have been associated with the World Cube Association as a member of the WCA Regulations Committee, and earlier as the senior delegate for South East Asia and India. A few achievements I'm particularly proud of are being the first Indian to officially solve a Rubik's cube blindfolded in under a minute (including memorization time) and currently holding a national record for solving a given scrambled Rubik's cube in as few moves as you can given an hour (my solution was 25 moves). I've held multiple national records in the past in the events of solving 3x3 blindfolded, 4x4 blindfolded, 5x5 blindfolded, and fewest moves challenge. My full speedcubing profile can be found here.
- I have been a member of the Science Popularization and Public Outreach Committee of TIFR.
- I enjoy playing lots of sports. Some of my favourites include volleyball, table tennis, ultimate frisbee, badminton.
- I've been playing Clicker Heroes for just over three years now.
- I enjoy playing Minesweeper in my free time. My best time is 74 seconds on the expert mode.
- I also have tons of other miscellaneous hobbies that might be too many to list here. Some include lindy hop, juggling, playing chess and playing PC games.
ContactPhone: +91 22 2278 2949
Office: A-206, STCS, TIFR
Email: firstname DOT lastname AT tifr DOT res DOT in