Applications are invited for Postdoctoral Fellow (Computational Complexity) at IIT Gandhinagar for the year 2021. The last date of application is 15 September.
Indian Institute of Technology Gandhinagar (IITGN) invites applications for a Postdoctoral Fellow in Computational Complexity Theory for a research project funded by Indian Institute of Technology, Gandhinagar.
The candidate will work on the project “Complexity of Graph Patterns”. This would involve a mathematical study of the existing methods to solve pattern (homomorphism, isomorphisms, induced isomorphisms, and related structures) detection and counting in graphs and proving conditional lower bounds or finding improved algorithms for this class of problems.
PhD in Complexity Theory, Theory of Algorithms, or related areas with a good scientific publication record. Experience working in graph algorithms or arithmetic circuit complexity is a plus. Candidates who have submitted their thesis are also eligible for the position.
Initial appointment is for 1 year, extendable up to 1 more year based on performance.
Candidates must send following documents via e-mail to Dr. Balagopal Komarath (bkomarath at iitgn dot ac dot in). The following documents must be sent as a single pdf attachment to the email:
- Current CV with a list of publications
- A one-page summary of previous research/work experience
- A one-page write-up about why you want to take up this postdoc position
- Names and email addresses of 2 potential referees
The applications will continue to be screened until the position is filled. The applications received before 15th September, 2021 will be given priority.
Click here to view the official notification of Postdoctoral Fellow (Computational Complexity) at IIT Gandhinagar.
You may also be interested in: