|
J5. On Lifting Lower Bounds for Noncommutative Circuits using Automata,
with V. Arvind, CJTCS, 2025.
C13. Characterizing and Testing Principal Minor Equivalence of Matrices ,
with Sumanta Ghosh, Rohit Gurjar, and Roshan Raj, STOC, 2025.
J4. Determinants vs. Algebraic Branching Programs,
with Mrinal Kumar, and Ben Lee Volk, Computational Complexity, 2024.
C12. Trading Determinism for Noncommutativity in Edmonds' Problem,
with V. Arvind and Partha Mukhopadhyay, FOCS, 2024.
C11. Black-box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial-time,
with V. Arvind and Partha Mukhopadhyay, STOC, 2024.
C10. Determinants vs. Algebraic Branching Programs,
with Mrinal Kumar, and Ben Lee Volk, ITCS, 2024.
I1. The Noncommutative Edmonds' Problem Re-visited,
with Partha Mukhopadhyay, pre-print.
C9. Border Complexity of Symbolic Determinant under Rank One Restriction,
with Sumanta Ghosh, Rohit Gurjar, and Roshan Raj, CCC, 2023.
C8. On Identity Testing and Noncommutative Rank Computation over the Free Skew Field,
with V. Arvind, Utsab Ghosal, Partha Mukhopadhyay, and C. Ramya, ITCS, 2023.
C7. Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time,
with V. Arvind and Partha Mukhopadhyay, RANDOM, 2022.
J3. Fast Exact Algorithms Using Hadamard Product of Polynomials,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, ALGORITHMICA, 2022.
J2. Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, ToCS, 2021.
C6. Equivalence Testing of Weighted Automata over Partially Commutative Monoids,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, MFCS, 2021.
C5. A Special Case of Rational Identity Testing and the Bre{\v}sar-Klep Theorem,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, MFCS, 2020.
J1. On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, CJTCS, 2020.
C4. Fast Exact Algorithms Using Hadamard Product of Polynomials,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, FSTTCS, 2019.
C3. On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, ISAAC, 2019.
C2. Efficient Black-Box Identity Testing for Free Group Algebras,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, RANDOM, 2019.
C1. Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators,
with V. Arvind, Rajit Datta, and Partha Mukhopadhyay, FSTTCS, 2018.
The list of publications is also available at dblp and Google Scholar.