I am a Researcher at MSR Silicon Valley in MountainView, California. I work in theoretical computer science, focusing on Coding theory, Computational learning and Boolean function complexity and the connections between them. I also dabble in other areas like hardness of approximation, data-stream algorithms and computational complexity.
I earned a B. Tech in Computer science from IIT Bombay followed by a Ph.D from Georgia Tech under the supervision of Dick Lipton. I spent two enjoyable years as a postdoc, first at UT Austin hosted by Adam Klivans and then at UW hosted by Venkat Guruswami. I have also spent fun times visiting Princeton University, the Technion, Haifa and TIFR Mumbai.
2009
Parikshit Gopalan, Ryan O'Donnell, Rocc O'Servedio, Amir Shpilka, and Karl Wimmer, Testing Fourier dimensionality and sparsity, in ICALP(1)'09, July 2009
Parikshit Gopalan, Shachar Lovett, and Amir Shpilka, On the Complexity of Boolean functions in different charactersistics, in CCC'09, July 2009
Parikshit Gopalan, Venkatesan Guruswami, and Prasad Raghavendra, List-Decoding Tensor products and Interleaved codes, in STOC'09, May 2009
Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, and Emanuele Viola, Bounded Independence fools halfspaces, April 2009
Parikshit Gopalan, A Fourier-analytic approach to Reed-Muller decoding, April 2009
Parikshit Gopalan and Jaikumar Radhakrishnan, Finding duplicates in a data stream, in SODA'09, January 2009
2008
Parikshit Gopalan, Adam Tauman Kalai, and Adam R. Klivans, A Query Algorithm for Agnostically Learning DNF?, in COLT'08 (open problem), July 2008
Parikshit Gopalan and Venkatesan Guruswami, Hardness Amplification within NP against Deterministic Algorithms, in CCC'08, June 2008
Parikshit Gopalan, Adam Tauman Kalai, and Adam R. Klivans, Agnostically learning decision trees, in STOC'08, May 2008
Parikshit Gopalan, Adam R. Klivans, and David Zuckerman, List-decoding Reed-Muller codes over small fields, in STOC'08, May 2008
2007
Parikshit Gopalan, Subhash Khot, and Rishi Saket, Hardness of Reconstructing Multivariate Polynomials over Finite Fields, in FOCS'07, October 2007
Parikshit Gopalan and Anna Gal, Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence, in FOCS'07, October 2007
Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar, Estimating the sortedness of a data stream, in SODA'07, January 2007
2006
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, and Ashok Ponnuswami, New Results for Learning Noisy Parities and Halfspaces, in FOCS'06, October 2006
Parikshit Gopalan, Computing with Polynomials over Composites, August 2006
Parikshit Gopalan, Constructing Ramsey Graphs from Boolean Function Representations, in CCC'06, July 2006
Parikshit Gopalan, Phokion Kolaitis, and Elitza Maneva, The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies, in ICALP(1), June 2006
Parikshit Gopalan, Venkatesan Guruswami, and Richard J. Lipton, Algorithms for Modular Counting of Roots of Multivariate Polynomials, in LATIN'06, March 2006
Parikshit Gopalan, Query-efficient algorithms for polynomial interpolation over composites., in SODA'06, January 2006
