| 2026 | STOC | Negations Are Powerful Even in Small Depth. | Bruno Cavalar, Tho Borm Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff |
| 2024 | FOCS | Trading Determinism for Noncommutativity in Edmonds' Problem. | Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay |
| 2024 | STOC | Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. | Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay |
| 2021 | MFCS | Equivalence Testing of Weighted Automata over Partially Commutative Monoids. | Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2021 | STOC | Lower bounds for monotone arithmetic circuits via communication complexity. | Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay |
| 2020 | MFCS | A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. | Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2019 | ISAAC | On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. | Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2017 | MFCS | Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. | Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja |
| 2017 | STOC | Randomized polynomial time identity testing for noncommutative circuits. | Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja |
| 2016 | CSR | Depth-4 Identity Testing and Noether's Normalization Lemma. | Partha Mukhopadhyay |
| 2014 | MFCS | On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. | Suryajith Chillara, Partha Mukhopadhyay |
| 2014 | STACS | Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. | Suryajith Chillara, Partha Mukhopadhyay |
| 2012 | LATIN | Erdős-Rnyi Sequences and Deterministic Construction of Expanding Cayley Graphs. | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
| 2012 | MFCS | Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
| 2010 | FOCS | Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka |
| 2010 | STOC | Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. | Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich |
| 2009 | STACS | Quantum Query Complexity of Multilinear Identity Testing. | Vikraman Arvind, Partha Mukhopadhyay |
| 2007 | ISAAC | The Monomial Ideal Membership Problem and Polynomial Identity Testing. | Vikraman Arvind, Partha Mukhopadhyay |
| 2006 | COCOON | The Complexity of Black-Box Ring Problems. | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
| 2006 | ISAAC | On Isomorphism and Canonization of Tournaments and Hypertournaments. | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |