Nikhil S. Mande
I am a postdoc in the Department of Computer Science at Georgetown University, where Justin Thaler is hosting me.
Before this, I was a research scholar in the School of Technology and Computer Science at TIFR Mumbai and my advisor was Arkadev Chattopadhyay. A (slightly outdated) bio can be found here.
Ph.D. in Computer Science in 2018 from the Tata Institute of Fundamental Research, Mumbai. 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 approximation theory, communication complexity, Boolean circuit complexity, and the connections between them.
Theses and projects
- My Ph.D. thesis is titled "Communication Complexity of XOR Functions". A version can be found here.
- 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.
- New: "The Log-Approximate-Rank Conjecture is False", with Arkadev Chattopadhyay and Suhail Sherif. To appear in STOC, 2019.
- "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, 2018. In Theory of Computing.
ECCC Report, Slides.
- "Lower Bounds for Linear Decision Lists", with Arkadev Chattopadhyay, Meena Mahajan and Nitin Saurabh, 2019.
ECCC Report, Arxiv preprint.
- "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.
- 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 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: +1 202 651 1191
Email: nikhil DOT mande AT georgetown DOT edu