Mrinal Kumar
Orcid: 0000-0002-6430-0219Affiliations:
- Tata Institute of Fundamental Research, Mumbai, India
- Indian Institute of Technology Bombay, Mumbai, India (former)
- University of Toronto, Canada (former)
- Harvard University, Cambridge, MA, USA (former)
- Rutgers University, Newark, NJ, USA (PhD)
According to our database1,
Mrinal Kumar
authored at least 58 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Electron. Colloquium Comput. Complex., 2024
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits.
Electron. Colloquium Comput. Complex., 2024
2023
Comput. Complex., June, 2023
Electron. Colloquium Comput. Complex., 2023
Electron. Colloquium Comput. Complex., 2023
Electron. Colloquium Comput. Complex., 2023
2022
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits.
ACM Trans. Comput. Theory, 2022
Electron. Colloquium Comput. Complex., 2022
Comput. Complex., 2022
2021
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications.
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
2020
ACM Trans. Comput. Theory, 2020
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits.
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits.
Comb., 2020
2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
Comput. Complex., 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Proceedings of the 33rd Computational Complexity Conference, 2018
2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
2016
ACM Trans. Comput. Theory, 2016
Electron. Colloquium Comput. Complex., 2016
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity.
Electron. Colloquium Comput. Complex., 2016
Electron. Colloquium Comput. Complex., 2016
2015
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In.
SIAM J. Comput., 2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
Sums of products of polynomials in few variables : lower bounds and polynomial identity testing.
Electron. Colloquium Comput. Complex., 2015
2014
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization.
Theor. Comput. Sci., 2014
2013
Electron. Colloquium Comput. Complex., 2013
Electron. Colloquium Comput. Complex., 2013
Electron. Colloquium Comput. Complex., 2013
2011
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011