The Complexity of Black-Box Ring Problems. - Vikraman Arvind; Bireswar Das; Partha Mukhopadhyay (COCOON, 2006)

The Monomial Ideal Membership Problem and Polynomial Identity Testing. - Vikraman Arvind; Partha Mukhopadhyay (ISAAC, 2007)

The Ideal Membership Problem and Polynomial Identity Testing. - Vikraman Arvind; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2007)

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. - Vikraman Arvind; Partha Mukhopadhyay (APPROX-RANDOM, 2008)

Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. - Vikraman Arvind; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2008)

Quantum Query Complexity of Multilinear Identity Testing. - Vikraman Arvind; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2008)

New Results on Noncommutative and Commutative Polynomial Identity Testing. - Vikraman Arvind; Partha Mukhopadhyay; Srikanth Srinivasan 001 (Comput. Complex., 2010)

Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. - Shachar Lovett; Partha Mukhopadhyay; Amir Shpilka (Electron. Colloquium Comput. Complex., 2010)

Isomorphism and canonization of tournaments and hypertournaments. - Vikraman Arvind; Bireswar Das; Partha Mukhopadhyay (J. Comput. Syst. Sci., 2010)

Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar (Electron. Colloquium Comput. Complex., 2011)

Expanding Generator Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (Electron. Colloquium Comput. Complex., 2011)

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (MFCS, 2012)

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (CoRR, 2012)

Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. - Shachar Lovett; Partha Mukhopadhyay; Amir Shpilka (Comput. Complex., 2013)

Determinantal Complexity of Iterated Matrix Multiplication Polynomial. - Suryajith Chillara; Partha Mukhopadhyay (CoRR, 2013)

MmPalateMiRNA, an R package compendium illustrating analysis of miRNA microarray data. - Guy N. Brock; Partha Mukhopadhyay; Vasyl Pihur; Cynthia Webb; Robert M. Greene; M. Michele Pisano (Source Code Biol. Medicine, 2013)

Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in. - Zohar Shay Karnin; Partha Mukhopadhyay; Amir Shpilka; Ilya Volkovich (SIAM J. Comput., 2013)

Depth-4 Identity Testing and Noether's Normalization Lemma. - Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2015)

Identity Testing for +-Regular Noncommutative Arithmetic Circuits. - Vikraman Arvind; Pushkar S. Joglekar; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2016)

Randomized Polynomial Time Identity Testing for Noncommutative Circuits. - Vikraman Arvind; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2016)

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. - Vikraman Arvind; Rajit Datta; Partha Mukhopadhyay; S. Raja 001 (MFCS, 2017)

Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. - Vikraman Arvind; Rajit Datta; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2017)

On the limits of depth reduction at depth 3 over small finite fields. - Suryajith Chillara; Partha Mukhopadhyay (Inf. Comput., 2017)

A Note on Polynomial Identity Testing for Depth-3 Circuits. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2018)

Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2018)

Expanding Generating Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (SIAM J. Discret. Math., 2018)

Efficient Black-Box Identity Testing for Free Group Algebras. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (APPROX-RANDOM, 2019)

Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. - Suryajith Chillara; Partha Mukhopadhyay (Comput. Complex., 2019)

Efficient Black-Box Identity Testing over Free Group Algebra. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2019)

Efficient Black-Box Identity Testing for Free Group Algebra. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2019)

Acceptance of Bengal Fasal Bima Yojona by the Farmers: A Study of Purba Burdwan District of West Bengal, India. - Partha Mukhopadhyay; Partha Pratim Sengupta (Int. J. Asian Bus. Inf. Manag., 2019)

Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. - Vikraman Arvind; Pushkar S. Joglekar; Partha Mukhopadhyay; S. Raja 001 (Theory Comput., 2019)

A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (MFCS, 2020)

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Chic. J. Theor. Comput. Sci., 2020)

Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2020)

Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity. - Arkadev Chattopadhyay; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2020)

Negations Provide Strongly Exponential Savings. - Arkadev Chattopadhyay; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2020)

Equivalence Testing of Weighted Automata over Partially Commutative Monoids. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (MFCS, 2021)

Monotone Complexity of Spanning Tree Polynomial Re-Visited. - Arkadev Chattopadhyay; Rajit Datta; Utsab Ghosal; Partha Mukhopadhyay (ITCS, 2022)

Fast Exact Algorithms Using Hadamard Product of Polynomials. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Algorithmica, 2022)

Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2022)

Robustly Separating the Arithmetic Monotone Hierarchy Via Graph Inner-Product. - Arkadev Chattopadhyay; Utsab Ghosal; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2022)

Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Theory Comput. Syst., 2022)

On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. - Vikraman Arvind; Abhranil Chatterjee 001; Utsab Ghosal; Partha Mukhopadhyay; C. Ramya (ITCS, 2023)

The Noncommutative Edmonds' Problem Re-visited. - Abhranil Chatterjee 001; Partha Mukhopadhyay (CoRR, 2023)

Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2023)

A general estimation technique of population mean under stratified successive sampling in presence of random scrambled response and non-response. - Partha Mukhopadhyay; Garib Nath Singh; Arnab Bandyopadhyay (Commun. Stat. Simul. Comput., 2023)

Trading Determinism for Noncommutativity in Edmonds' Problem. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2024)

IPS Lower Bounds for Formulas and Sum of1 ROABPs. - Prerona Chatterjee; Utsab Ghosal; Partha Mukhopadhyay; Amit Sinhababu (Electron. Colloquium Comput. Complex., 2025)

Efficient Polynomial Identity Testing Over Nonassociative Algebras. - Partha Mukhopadhyay; C. Ramya; Pratik Shastri (Electron. Colloquium Comput. Complex., 2025)

IPS Lower Bounds for Formulas and Sum of ROABPs. - Prerona Chatterjee; Utsab Ghosal; Partha Mukhopadhyay; Amit Sinhababu (CoRR, 2025)