Computing symmetric determinantal representations. - Justin Chen; Papri Dey (CoRR, 2019)

Testing Hyperbolicity of Real Polynomials. - Papri Dey; Daniel Plaumann (Math. Comput. Sci., 2020)

Bit Complexity of Jordan Normal Form and Spectral Factorization. - Papri Dey; Ravi Kannan; Nick Ryder; Nikhil Srivastava (CoRR, 2021)

Definite determinantal representations via orthostochastic matrices. - Papri Dey (J. Symb. Comput., 2021)

Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization. - Papri Dey; Ravi Kannan; Nick Ryder; Nikhil Srivastava (ITCS, 2023)

The 4 × 4 Orthostochastic Variety. - Justin Chen; Papri Dey (Exp. Math., 2023)