Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes. - Mrinalkanti Ghosh; Satyadev Nandakumar (ALT, 2012)

Ornstein Isomorphism and Algorithmic Randomness. - Mrinalkanti Ghosh; Satyadev Nandakumar; Atanu Pal (CoRR, 2014)

Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. - Vijay V. S. P. Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2016)

From Weak to Strong LP Gaps for all CSPs. - Mrinalkanti Ghosh; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2016)

Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. - Vijay Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (FOCS, 2017)

Inapproximability of Matrix p→q Norms. - Vijay Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2018)

Approximating Operator Norms via Generalized Krivine Rounding. - Vijay Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2018)

From Weak to Strong Linear Programming Gaps for All Constraint Satisfaction Problems. - Mrinalkanti Ghosh; Madhur Tulsiani (Theory Comput., 2018)

Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. - Vijay Bhattiprolu; Mrinalkanti Ghosh; Venkatesan Guruswami; Euiwoong Lee; Madhur Tulsiani (SODA, 2019)

Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes. - Mrinalkanti Ghosh; Fernando Granha Jeronimo; Chris Jones; Aaron Potechin; Goutham Rajendran (FOCS, 2020)