The Coin Problem in Constant Depth: Sample Complexity and Parity gates. - Nutan Limaye; Karteek Sreenivasaiah; Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (Electron. Colloquium Comput. Complex., 2018)

A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. - Nutan Limaye; Karteek Sreenivasaiah; Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (STOC, 2019)

Decoding Downset codes over a finite grid. - Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (Electron. Colloquium Comput. Complex., 2019)

On the Probabilistic Degrees of Symmetric Boolean functions. - Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (Electron. Colloquium Comput. Complex., 2019)

Decoding Variants of Reed-Muller Codes over Finite Grids. - Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (ACM Trans. Comput. Theory, 2020)

On the Probabilistic Degree of an $n$-variate Boolean Function. - Srikanth Srinivasan 001; S. Venkitesh (Electron. Colloquium Comput. Complex., 2021)

A Fixed-Depth Size-Hierarchy Theorem for $ mathrm{AC}^0[ oplus]$ via the Coin Problem. - Nutan Limaye; Karteek Sreenivasaiah; Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (SIAM J. Comput., 2021)

Covering Symmetric Sets of the Boolean Cube by Affine Hyperplanes. - S. Venkitesh (Electron. J. Comb., 2022)

Polynomials, Divided Differences, and Codes. - S. Venkitesh (ITCS, 2025)