Journal Papers

Solving polynomial systems over non-fields and applications to modular polynomial factoring

with Sayak Chakrabarti and Nitin Saxena

Journal of Symbolic Computation, vol.125, 2024. [pdf] [Journal version]

Efficiently factoring polynomials modulo p4

with Rajat Mittal and Nitin Saxena

Journal version in Journal of Symbolic Computation, 104:805--823, 2021. [pdf]

(preliminary version in ISSAC'19)

Conference Papers

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields

with Zeyu Guo and Ben Lee Volk

To appear in 28th International Conference on Randomization and Computation (RANDOM), 2024. [pdf]

Computing Igusa's local zeta function of univariates in deterministic polynomial-time

with Nitin Saxena

14th Biannual Algorithmic Number Theory Symposium, ANTS-XIV, vol.4, 197--214, 2020. [pdf]

Counting basic-irreducible factors mod pk in deterministic poly-time and p-adic applications

with Rajat Mittal and Nitin Saxena

34th Computational Complexity Conference (CCC), 15:1--15:29, 2019. [pdf] [slides]

Efficiently factoring polynomials modulo p4

with Rajat Mittal and Nitin Saxena

44th International Symposium on Symbolic and Algebraic Computation (ISSAC), 139--146, 2019. [pdf]

Thesis

Polynomials over composites: Compact root representation via ideals and algorithmic consequences, 2023

PhD Thesis [pdf]), IIT Kanpur

On the Complexity of Hilbert's Nullstellensatz over Positive Characteristic, 2017 

MTech Thesis [pdf], IIT Kanpur