S. Venkitesh

According to our database, S. Venkitesh authored at least 9 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size.

Noga Ron-Zewi, S. Venkitesh, Mary Wootters

CoRR, 2024

2022

Covering Symmetric Sets of the Boolean Cube by Affine Hyperplanes.

S. Venkitesh

Electron. J. Comb., 2022

2021

On the Probabilistic Degrees of Symmetric Boolean Functions.

Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

SIAM J. Discret. Math., 2021

A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem.

Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

SIAM J. Comput., 2021

On the Probabilistic Degree of an $n$-variate Boolean Function.

Srikanth Srinivasan, S. Venkitesh

Electron. Colloquium Comput. Complex., 2021

2020

Decoding Variants of Reed-Muller Codes over Finite Grids.

Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

ACM Trans. Comput. Theory, 2020

2019

Decoding Downset codes over a finite grid.

Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

Electron. Colloquium Comput. Complex., 2019

A fixed-depth size-hierarchy theorem for AC⁰[⊕] via the coin problem.

Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

The Coin Problem in Constant Depth: Sample Complexity and Parity gates.

Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

Electron. Colloquium Comput. Complex., 2018