Abhranil Chatterjee

INSPIRE Faculty

Advanced Computing and Microelectronics Unit

Computer and Communication Sciences Division

Indian Statistical Institute, Kolkata

Email: abhneil [at] gmail [dot] com

I am interested in the theoretical aspects of computer science, specifically, in complexity theory and designing algorithms with algebraic techniques.
Here is a link to my resume.

Research Publications

Teaching

July, 2024		Design and Analysis of Algorithms
January, 2024		Computational Complexity
July, 2023		Algorithms for Big Data
January, 2023		Programming & Data Structures II

Past Employment

2022-	2023		Visiting Faculty in the School of Computer Sciences at National Institute of Science Education and Research, Bhubaneswar
2021-	2022		Postdoctoral Researcher in the Department of Computer Science and Engineering at Indian Institute of Technology, Bombay

Background

2016-	2022		Ph.D. in Theoretical Computer Science from The Institute of Mathematical Sciences (HBNI), Chennai
			Advisors: V. Arvind and Partha Mukhopadhyay
2014-	2016		M.E. in Computer Science and Engineering from Jadavpur University
2009-	2013		B.Tech in Computer Science and Engineering from Kalyani Government Engineering College

Talks (Videos)

Black-box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial-time
at STOC, 2024 (pre-recorded conference talk).

Determinants vs. Algebraic Branching Programs
at ITCS, 2024 (pre-recorded conference talk).

Black-box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial-time
at STCS Seminar, TIFR, India.

Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time
at WACT(2023), University of Warwick, UK.

On Identity Testing and Noncommutative Rank Computation over the Free Skew Field
at ITCS, 2023 (pre-recorded conference talk).

Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time
at RANDOM, 2022 (pre-recorded conference talk).

A Special Case of Rational Identity Testing and the Bresar-Klep Theorem
at MFCS, 2020 (pre-recorded conference talk).

Arithmetic Complexity of Symmetrized Symmetric Polynomials and Multilinear Monomial Counting
at WACT(2019), ICTS, India.

Recent Update

My paper Determinants vs. Algebraic Branching Programs with Mrinal Kumar and Ben Lee Volk has been accepted at Computational Complexity journal.

I have been awarded a travel grant by Microsoft Research to attend FOCS, 2024.

My paper Trading Determinism for Noncommutativity in Edmonds' Problem, with V. Arvind and Partha Mukhopadhyay has been accepted at FOCS, 2024.

Our paper Black-box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial-time has been invited to STOC 2024 Special Issue, in SIAM Journal on Computing (SICOMP).

I have been awarded a travel grant by Google Research to attend STOC, 2024.

My paper Black-box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial-time with V. Arvind and Partha Mukhopadhyay has been accepted at STOC, 2024.

My paper Determinants vs. Algebraic Branching Programs with Mrinal Kumar and Ben Lee Volk has been accepted at ITCS, 2024.

In a joint work with V. Arvind and Partha Mukhopadhyay (Black-box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial-time), we solved the black-box RIT problem.

Professional Recognition

Serving as one of the area chairs at ACM India ARCS 2025

Invited speaker for CALDAM 2025 Indo-Spain Pre-Conference School on Algorithms and Combinatorics during February 10-11, 2025.

I was a co-organizer of the workshop Recent Trends in Algorithm, 2023 held at NISER, Bhubaneswar from July 26--28, 2023.

I have been awarded the INSPIRE Faculty Fellowship(2022) by the Department of Science and Technology, Government of India.