Mrinal Kumar - RankMe

164 papers A* 16A 14B 2Journal 125Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Advances in List Decoding of Polynomial Codes. CoRR Mrinal Kumar, Noga Ron-Zewi
2026	J	`jnl`	Advances in List Decoding of Polynomial Codes. Electron. Colloquium Comput. Complex. Mrinal Kumar, Noga Ron-Zewi
2026	J	`jnl`	Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. ACM Trans. Comput. Theory Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
2025	J	`jnl`	Algorithmizing the Multiplicity Schwartz-Zippel Lemma. TheoretiCS Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2025	J	`jnl`	An exposition of recent list-size bounds of FRS Codes. CoRR Abhibhav Garg, Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Ashutosh Shankar
2025	J	`jnl`	An exposition of recent list-size bounds of FRS Codes. Electron. Colloquium Comput. Complex. Abhibhav Garg, Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Ashutosh Shankar
2025	J	`jnl`	Closure under factorization from a result of Furstenberg. CoRR Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025	J	`jnl`	Closure under factorization from a result of Furstenberg. Electron. Colloquium Comput. Complex. Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025	J	`jnl`	Constant-depth circuits for polynomial GCD over any characteristic. CoRR Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025	J	`jnl`	Constant-depth circuits for polynomial GCD over any characteristic. Electron. Colloquium Comput. Complex. Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025	A*	`conf`	Deterministic factorization of constant-depth algebraic circuits in subexponential time. FOCS Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025	J	`jnl`	Deterministic factorization of constant-depth algebraic circuits in subexponential time. CoRR Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025	J	`jnl`	Deterministic factorization of constant-depth algebraic circuits in subexponential time. Electron. Colloquium Comput. Complex. Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025	J	`jnl`	Deterministic list decoding of Reed-Solomon codes. CoRR Soham Chatterjee, Prahladh Harsha, Mrinal Kumar
2025	J	`jnl`	Deterministic list decoding of Reed-Solomon codes. Electron. Colloquium Comput. Complex. Soham Chatterjee, Prahladh Harsha, Mrinal Kumar
2025	J	`jnl`	Fast list recovery of univariate multiplicity and folded Reed-Solomon codes. CoRR Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2025	J	`jnl`	Fast list recovery of univariate multiplicity and folded Reed-Solomon codes. Electron. Colloquium Comput. Complex. Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2025	A*	`conf`	High Rate Multivariate Polynomial Evaluation Codes. STOC Swastik Kopparty, Mrinal Kumar, Harry Sha
2025	J	`jnl`	Modular composition & polynomial GCD in the border of small, shallow circuits. Electron. Colloquium Comput. Complex. Robert Andrews, Mrinal Kumar, Shanthanu S. Rai
2024	A*	`conf`	An Improved Line-Point Low-Degree Test. FOCS Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2024	J	`jnl`	Decoding Multivariate Multiplicity Codes on Product Sets. IEEE Trans. Inf. Theory Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2024	A	`conf`	Determinants vs. Algebraic Branching Programs. ITCS Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
2024	J	`jnl`	Determinants vs. Algebraic Branching Programs. Comput. Complex. Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
2024	A*	`conf`	Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. SODA Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
2024	A*	`conf`	Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes. FOCS Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2024	J	`jnl`	Fast Multivariate Multipoint Evaluation over All Finite Fields. J. ACM Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
2024	J	`jnl`	High Rate Multivariate Polynomial Evaluation Codes. CoRR Swastik Kopparty, Mrinal Kumar, Harry Sha
2024	J	`jnl`	High Rate Multivariate Polynomial Evaluation Codes. Electron. Colloquium Comput. Complex. Swastik Kopparty, Mrinal Kumar, Harry Sha
2024	J	`jnl`	Ideal-Theoretic Explanation of Capacity-Achieving Decoding. IEEE Trans. Inf. Theory Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2024	J	`jnl`	Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. CoRR Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
2024	J	`jnl`	Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
2023	A*	`conf`	Algorithmizing the Multiplicity Schwartz-Zippel Lemma. SODA Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2023	J	`jnl`	An Improved Line-Point Low-Degree Test. CoRR Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2023	J	`jnl`	An Improved Line-Point Low-Degree Test. Electron. Colloquium Comput. Complex. Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2023	J	`jnl`	Determinants vs. Algebraic Branching Programs. CoRR Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
2023	J	`jnl`	Determinants vs. Algebraic Branching Programs. Electron. Colloquium Comput. Complex. Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
2023	J	`jnl`	Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. CoRR Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
2023	J	`jnl`	Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
2023	A*	`conf`	Fast Numerical Multivariate Multipoint Evaluation. FOCS Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023	J	`jnl`	Fast Numerical Multivariate Multipoint Evaluation. CoRR Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023	J	`jnl`	Fast Numerical Multivariate Multipoint Evaluation. Electron. Colloquium Comput. Complex. Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023	J	`jnl`	Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. CoRR Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2023	J	`jnl`	Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. Electron. Colloquium Comput. Complex. Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2023	J	`jnl`	Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. J. ACM Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra
2023	J	`jnl`	Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models. Theory Comput. Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
2023	J	`jnl`	Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Comput. Complex. Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2022	J	`jnl`	A Lower Bound on Determinantal Complexity. Comput. Complex. Mrinal Kumar, Ben Lee Volk
2022	J	`jnl`	A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits. ACM Trans. Comput. Theory Ben Lee Volk, Mrinal Kumar
2022	J	`jnl`	Derandomization from Algebraic Hardness. SIAM J. Comput. Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2022	A*	`conf`	Fast Multivariate Multipoint Evaluation Over All Finite Fields. FOCS Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
2022	J	`jnl`	Fast Multivariate Multipoint Evaluation Over All Finite Fields. CoRR Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
2022	J	`jnl`	Fast Multivariate Multipoint Evaluation Over All Finite Fields. Electron. Colloquium Comput. Complex. Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
2022	A*	`conf`	Fast, algebraic multivariate multipoint evaluation in small characteristic and applications. STOC Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra
2022	A	`conf`	If VNP Is Hard, Then so Are Equations for It. STACS Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2022	J	`jnl`	Monotone Circuit Lower Bounds from Robust Sunflowers. Algorithmica Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
2022	J	`jnl`	Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. Comput. Complex. Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
2021	A	`conf`	A Lower Bound on Determinantal Complexity. CCC Mrinal Kumar, Ben Lee Volk
2021	A	`conf`	A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits. ITCS Mrinal Kumar, Ben Lee Volk
2021	J	`jnl`	Algorithmizing the Multiplicity Schwartz-Zippel Lemma. CoRR Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2021	J	`jnl`	Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2021	A*	`conf`	Decoding multivariate multiplicity codes on product sets. STOC Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2021	J	`jnl`	Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. CoRR Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra
2021	J	`jnl`	Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. Electron. Colloquium Comput. Complex. Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra
2021	—	`conf`	Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2021	J	`jnl`	Ideal-theoretic Explanation of Capacity-achieving Decoding. CoRR Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2021	J	`jnl`	Ideal-theoretic Explanation of Capacity-achieving Decoding. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2021	J	`jnl`	Lower Bounds for Matrix Factorization. Comput. Complex. Ben Lee Volk, Mrinal Kumar
2020	J	`jnl`	A Lower Bound on Determinantal Complexity. CoRR Mrinal Kumar, Ben Lee Volk
2020	J	`jnl`	A Lower Bound on Determinantal Complexity. Electron. Colloquium Comput. Complex. Mrinal Kumar, Ben Lee Volk
2020	J	`jnl`	A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. CoRR Mrinal Kumar, Ben Lee Volk
2020	J	`jnl`	A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Ben Lee Volk
2020	A	`conf`	A Quadratic Lower Bound for Algebraic Branching Programs. CCC Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
2020	J	`jnl`	Decoding Multivariate Multiplicity Codes on Product Sets. CoRR Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2020	J	`jnl`	Decoding Multivariate Multiplicity Codes on Product Sets. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2020	J	`jnl`	If VNP is hard, then so are equations for it. CoRR Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020	J	`jnl`	If VNP is hard, then so are equations for it. Electron. Colloquium Comput. Complex. Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020	A	`conf`	Lower Bounds for Matrix Factorization. CCC Mrinal Kumar, Ben Lee Volk
2020	B	`conf`	Monotone Circuit Lower Bounds from Robust Sunflowers. LATIN Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
2020	J	`jnl`	Monotone Circuit Lower Bounds from Robust Sunflowers. CoRR Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
2020	J	`jnl`	Monotone Circuit Lower Bounds from Robust Sunflowers. Electron. Colloquium Comput. Complex. Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
2020	—	`conf`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2020	A*	`conf`	On the Existence of Algebraically Natural Proofs. FOCS Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020	J	`jnl`	On the Existence of Algebraically Natural Proofs. CoRR Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020	J	`jnl`	On the Existence of Algebraically Natural Proofs. Electron. Colloquium Comput. Complex. Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020	J	`jnl`	On the Power of Border of Depth-3 Arithmetic Circuits. ACM Trans. Comput. Theory Mrinal Kumar
2020	A	`conf`	Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. CCC Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2020	J	`jnl`	Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Comb. Noga Alon, Mrinal Kumar, Ben Lee Volk
2019	J	`jnl`	A Quadratic Lower Bound for Algebraic Branching Programs. CoRR Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
2019	J	`jnl`	A Quadratic Lower Bound for Algebraic Branching Programs. Electron. Colloquium Comput. Complex. Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
2019	J	`jnl`	A quadratic lower bound for homogeneous algebraic branching programs. Comput. Complex. Mrinal Kumar
2019	J	`jnl`	Closure Results for Polynomial Factorization. Theory Comput. Chi-Ning Chou, Mrinal Kumar, Noam Solomon
2019	J	`jnl`	Closure of VP under taking factors: a short and simple proof. CoRR Chi-Ning Chou, Mrinal Kumar, Noam Solomon
2019	J	`jnl`	Closure of VP under taking factors: a short and simple proof. Electron. Colloquium Comput. Complex. Chi-Ning Chou, Mrinal Kumar, Noam Solomon
2019	A*	`conf`	Derandomization from Algebraic Hardness: Treading the Borders. FOCS Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2019	J	`jnl`	Derandomization from Algebraic Hardness: Treading the Borders. CoRR Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2019	J	`jnl`	Derandomization from Algebraic Hardness: Treading the Borders. Electron. Colloquium Comput. Complex. Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2019	J	`jnl`	Hardness-Randomness Tradeoffs for Algebraic Computation. Bull. EATCS Mrinal Kumar, Ramprasad Saptharishi
2019	J	`jnl`	Lower Bounds for Matrix Factorization. CoRR Mrinal Kumar, Ben Lee Volk
2019	J	`jnl`	Lower Bounds for Matrix Factorization. Electron. Colloquium Comput. Complex. Mrinal Kumar, Ben Lee Volk
2019	A*	`conf`	Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. SODA Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
2019	J	`jnl`	Schur Polynomials do not have small formulas if the Determinant doesn't! CoRR Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2019	J	`jnl`	Schur Polynomials do not have small formulas if the Determinant doesn't! Electron. Colloquium Comput. Complex. Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2019	J	`jnl`	The Computational Power of Depth Five Arithmetic Circuits. SIAM J. Comput. Mrinal Kumar, Ramprasad Saptharishi
2019	A*	`conf`	Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. ICALP Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
2019	J	`jnl`	Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. CoRR Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
2019	J	`jnl`	Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
2018	J	`jnl`	Arithmetic Circuits with Locally Low Algebraic Rank. CoRR Mrinal Kumar, Shubhangi Saraf
2018	A	`conf`	Hardness vs Randomness for Bounded Depth Arithmetic Circuits. CCC Chi-Ning Chou, Mrinal Kumar, Noam Solomon
2018	J	`jnl`	Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. CoRR Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
2018	J	`jnl`	Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
2018	J	`jnl`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2018	J	`jnl`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2018	J	`jnl`	On top fan-in vs formal degree for depth-3 arithmetic circuits. CoRR Mrinal Kumar
2018	J	`jnl`	On top fan-in vs formal degree for depth-3 arithmetic circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar
2018	J	`jnl`	Some Closure Results for Polynomial Factorization and Applications. CoRR Chi-Ning Chou, Mrinal Kumar, Noam Solomon
2018	J	`jnl`	Some Closure Results for Polynomial Factorization and Applications. Electron. Colloquium Comput. Complex. Chi-Ning Chou, Mrinal Kumar, Noam Solomon
2018	A	`conf`	Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CCC Noga Alon, Mrinal Kumar, Ben Lee Volk
2017	A	`conf`	A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs. CCC Mrinal Kumar
2017	J	`jnl`	A quadratic lower bound for homogeneous algebraic branching programs. Electron. Colloquium Comput. Complex. Mrinal Kumar
2017	J	`jnl`	An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CoRR Mrinal Kumar, Ben Lee Volk
2017	J	`jnl`	An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Ben Lee Volk
2017	A	`conf`	An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields. CCC Mrinal Kumar, Ramprasad Saptharishi
2017	J	`jnl`	Arithmetic Circuits with Locally Low Algebraic Rank. Theory Comput. Mrinal Kumar, Shubhangi Saraf
2017	J	`jnl`	On the Power of Homogeneous Depth 4 Arithmetic Circuits. SIAM J. Comput. Mrinal Kumar, Shubhangi Saraf
2017	J	`jnl`	Towards an algebraic natural proofs barrier via polynomial identity testing. CoRR Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, Shubhangi Saraf
2017	J	`jnl`	Towards an algebraic natural proofs barrier via polynomial identity testing. Electron. Colloquium Comput. Complex. Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, Shubhangi Saraf
2016	J	`jnl`	Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices. ACM Trans. Comput. Theory Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
2016	A	`conf`	Arithmetic Circuits with Locally Low Algebraic Rank. CCC Mrinal Kumar, Shubhangi Saraf
2016	J	`jnl`	Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. Theory Comput. Swastik Kopparty, Mrinal Kumar, Michael E. Saks
2016	—	`conf`	Finer Separations Between Shallow Arithmetic Circuits. FSTTCS Mrinal Kumar, Ramprasad Saptharishi
2016	J	`jnl`	Finer separations between shallow arithmetic circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Ramprasad Saptharishi
2016	A	`conf`	Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity. CCC Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
2016	J	`jnl`	Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. CoRR Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
2016	J	`jnl`	Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. Electron. Colloquium Comput. Complex. Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
2016	A	`conf`	Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing. CCC Mrinal Kumar, Shubhangi Saraf
2016	J	`jnl`	The Chasm at Depth Four, and Tensor Rank : Old results, new insights. CoRR Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay
2016	J	`jnl`	The Chasm at Depth Four, and Tensor Rank : Old results, new insights. Electron. Colloquium Comput. Complex. Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay
2015	J	`jnl`	An exponential lower bound for homogeneous depth-5 circuits over finite fields. CoRR Mrinal Kumar, Ramprasad Saptharishi
2015	J	`jnl`	An exponential lower bound for homogeneous depth-5 circuits over finite fields. Electron. Colloquium Comput. Complex. Mrinal Kumar, Ramprasad Saptharishi
2015	J	`jnl`	Arithmetic circuits with locally low algebraic rank. Electron. Colloquium Comput. Complex. Mrinal Kumar, Shubhangi Saraf
2015	J	`jnl`	Efficient indexing of necklaces and irreducible polynomials over finite fields. CoRR Swastik Kopparty, Mrinal Kumar, Michael E. Saks
2015	J	`jnl`	Efficient indexing of necklaces and irreducible polynomials over finite fields. Electron. Colloquium Comput. Complex. Swastik Kopparty, Mrinal Kumar, Michael E. Saks
2015	J	`jnl`	Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
2015	J	`jnl`	Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. CoRR Mrinal Kumar, Shubhangi Saraf
2015	J	`jnl`	Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. Electron. Colloquium Comput. Complex. Mrinal Kumar, Shubhangi Saraf
2015	J	`jnl`	The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In. SIAM J. Comput. Mrinal Kumar, Shubhangi Saraf
2014	J	`jnl`	Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theor. Comput. Sci. Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
2014	—	`conf`	Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. ICALP (1) Swastik Kopparty, Mrinal Kumar, Michael E. Saks
2014	A*	`conf`	On the Power of Homogeneous Depth 4 Arithmetic Circuits. FOCS Mrinal Kumar, Shubhangi Saraf
2014	J	`jnl`	On the power of homogeneous depth 4 arithmetic circuits. CoRR Mrinal Kumar, Shubhangi Saraf
2014	J	`jnl`	On the power of homogeneous depth 4 arithmetic circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Shubhangi Saraf
2014	—	`conf`	Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits. ICALP (1) Mrinal Kumar, Shubhangi Saraf
2014	A*	`conf`	The limits of depth reduction for arithmetic formulas: it's all about the top fan-in. STOC Mrinal Kumar, Shubhangi Saraf
2013	J	`jnl`	Arithmetic Circuit Lower Bounds via MaxRank CoRR Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
2013	—	`conf`	Arithmetic Circuit Lower Bounds via MaxRank. ICALP (1) Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
2013	J	`jnl`	Arithmetic Circuit Lower Bounds via MaxRank. Electron. Colloquium Comput. Complex. Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
2013	J	`jnl`	Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. Electron. Colloquium Comput. Complex. Mrinal Kumar, Shubhangi Saraf
2013	J	`jnl`	Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. CoRR Mrinal Kumar, Shubhangi Saraf
2013	J	`jnl`	Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. Electron. Colloquium Comput. Complex. Mrinal Kumar, Shubhangi Saraf
2013	J	`jnl`	The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in. CoRR Mrinal Kumar, Shubhangi Saraf
2013	J	`jnl`	The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in. Electron. Colloquium Comput. Complex. Mrinal Kumar, Shubhangi Saraf
2012	—	`conf`	Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
2011	J	`jnl`	A Characterization of all Stable Minimal Separator Graphs CoRR Mrinal Kumar, Gaurav Maheshwari, N. Sadagopan
2011	B	`conf`	Approximation Algorithms for Minimum Chain Vertex Deletion. WALCOM Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh