I am a postdoctoral fellow in the department of Computer Science at Johns Hopkins University working with Prof. Xin Li on error correcting codes.
I completed my Ph.D from Purdue University under the supervision of Prof. Elena Grigorescu .
Research
I am interested in wellmotivated algorithmic problems with some algebraic flavor. My research so far has focused on the near neighbor search problem and its variants on unstructured data and on structured algebraic objects such as lattices and errorcorrecting codes.
Publications

Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Relaxed Locally Correctable Codes in Computationally Bounded Channels
Brief announcement in International Colloquium on Automata, Languages, and Programming (ICALP), 2018 
Karthik Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
Latticebased Locality Sensitive Hashing
Proceedings of Innovations in Theoretical Computer Science (ITCS), 2018 
Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu
Maximally Recoverable Codes: the Bounded Case
Proceedings of Allerton Conference, 2017. 
Venkata Gandikota
Local and Global Computation on Algebraic Data
Ph.D. Dissertation 2017. 
Karthik Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing for Membership in Lattices
Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2016.
SIAM Journal of Discrete Mathematics, (2018). 
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
NPHardness of ReedSolomon Decoding and the ProuhetTarryEscott Problem
IEEE Symposium on Foundations of Computer Science (FOCS) 2016. 
Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
Nearly Optimal Sparse Group Testing
Proceedings of Allerton Conference, 2016. 
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
On the NPhardness of Bounded Distance Decoding of ReedSolomon Codes
IEEE International Symposium on Information Theory (ISIT) 2015. 
Karthik Chandrasekaran, Venkata Gandikota, Elena Grigorescu
Deciding Orthogonality in ConstructionA Lattices
Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2015.
SIAM Journal of Discrete Mathematics, 12441262 (2017).
Internships

CWI, Amsterdam, The Netherlands
Aug  Nov, 2016 
IBM Reaseach Labs India, Bangalore, India
May  Aug, 2012 
HP Labs India, Bangalore, India
Aug 2009  May 2010
Teaching
 Problem Solving and OOP (CS 180), Fall 2012 , Spring 2013 at Purdue University
 Numerical methods (CS 314), Fall 2010 , Spring 2011, Spring 2012 at Purdue University
 Systems Programming (CS252), Fall 2011 at Purdue University
 Foundations of Computer Science (CS182), Fall 2011 at Purdue University
 Programming with Multimedia Objects (CS 177), Spring 2011, Fall 2012 at Purdue University
 Introduction to Cryptography (CS355), Fall 2010 at Purdue Universiy
Relevant Courses
 Analysis and Design of Algorithms, Sublineartime Algorithms, Randomized Algorithms,
 Theory of Computation, Computational Complexity, A Mathematical Toolkit
 Algrebraic Geometry, Numerical Linear Algebra,
 Cryptography, Advanced Cryptology, Elliptic Curves and Cryptography
Other Activities
 TCS Reading Group: A gathering of all graduate students in theory CS to discuss a particular topic or paper of interest.