| Generalized matrix completion and algebraic natural proofs M Bläser, C Ikenmeyer, G Jindal, V Lysikov Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 21 | 2018 |
| Density Independent Algorithms for Sparsifying -Step Random Walks G Jindal, P Kolev, R Peng, S Sawlani arXiv preprint arXiv:1702.06110, 2017 | 18 | 2017 |
| On the complexity of symmetric polynomials M Bläser, G Jindal 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019 | 9 | 2019 |
| Greedy strikes again: A deterministic PTAS for commutative rank of matrix spaces M Bläser, G Jindal, A Pandey 32nd Computational Complexity Conference (CCC 2017), 2017 | 9 | 2017 |
| How many zeros of a random sparse polynomial are real? G Jindal, A Pandey, H Shukla, C Zisopoulos Proceedings of the 45th international symposium on symbolic and algebraic …, 2020 | 7 | 2020 |
| A new deterministic algorithm for sparse multivariate polynomial interpolation M Bläser, G Jindal Proceedings of the 39th International Symposium on Symbolic and Algebraic …, 2014 | 7 | 2014 |
| A deterministic PTAS for the commutative rank of matrix spaces M Bläser, G Jindal, A Pandey Theory of Computing 14 (1), 1-21, 2018 | 6 | 2018 |
| Efficiently computing real roots of sparse polynomials G Jindal, M Sagraloff Proceedings of the 2017 ACM on International Symposium on Symbolic and …, 2017 | 6 | 2017 |
| Arithmetic circuit complexity of division and truncation P Dutta, G Jindal, A Pandey, A Sinhababu 36th Computational Complexity Conference (CCC 2021), 2021 | 3 | 2021 |
| A deterministic PTAS for the algebraic rank of bounded degree polynomials V Bhargava, M Bläser, G Jindal, A Pandey Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 3 | 2019 |
| De-bordering and Geometric Complexity Theory for Waring rank and related models P Dutta, F Gesmundo, C Ikenmeyer, G Jindal, V Lysikov arXiv preprint arXiv:2211.07055, 2022 | 2 | 2022 |
| On approximate polynomial identity testing and real root finding G Jindal Saarländische Universitäts-und Landesbibliothek, 2019 | 2 | 2019 |
| Subtraction makes computing integers faster T Saranurak, G Jindal arXiv preprint arXiv:1212.2549, 2012 | 2 | 2012 |
| On the Order of Power Series and the Sum of Square Roots Problem G Jindal, L Gaillard Proceedings of the 2023 International Symposium on Symbolic and Algebraic …, 2023 | 1 | 2023 |
| Border complexity via elementary symmetric polynomials. P Dutta, F Gesmundo, C Ikenmeyer, G Jindal, V Lysikov arXiv preprint arXiv:2211.07055, 2022 | 1 | 2022 |
| On the Counting Complexity of the Skolem Problem G Jindal, J Ouaknine arXiv preprint arXiv:2403.00098, 2024 | | 2024 |
| PosSLP and Sum of Squares M Bläser, J Dörfler, G Jindal arXiv preprint arXiv:2403.00115, 2024 | | 2024 |
| Fixed-parameter debordering of Waring rank P Dutta, F Gesmundo, C Ikenmeyer, G Jindal, V Lysikov arXiv preprint arXiv:2401.07631, 2024 | | 2024 |
| On the Hardness of PosSLP P Bürgisser, G Jindal Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | | 2024 |
| Homogeneous Algebraic Complexity Theory and Algebraic Formulas P Dutta, F Gesmundo, C Ikenmeyer, G Jindal, V Lysikov arXiv preprint arXiv:2311.17019, 2023 | | 2023 |
