Email: vmkumar at cs dot utexas dot edu

I am a second-year Ph.D. student in UT Austin's Computer Science Theory group, advised by David Zuckerman. I am interested in complexity theory and Boolean function analysis, especially pseudorandomness and correlation bounds.

Before joining UT Austin in 2021, I received my B.S. in Mathematics and Computer Science at Caltech. During my undergraduate studies, I was fortunate to be mentored by Venkatesan Guruswami and Leonard Schulman.

**Tight Correlation Bounds for Circuits Between AC0 and TC0**

Vinayak M. Kumar

*CCC 2023 (to appear)*

(ECCC) (arXiv)**Pseudobinomiality of the Sticky Random Walk**

Venkatesan Guruswami, Vinayak M. Kumar

*ITCS 2021*

(ECCC) (ITCS Proceedings) (My Talk at ITCS)**Condition Number Bounds for Causal Inference**

Spencer Gordon, Vinayak M. Kumar, Leonard Schulman, Piyush Srivastava

*UAI 2021*

(UAI Proceedings) (Piyush's Talk at Simons)

- CS 388C: Combinatorics and Graph Theory (Spring 2023)

- CS 151: Complexity Theory (Spring 2021)
- CS 139: Design and Analysis of Algorithms (Winter 2021)
- CS 38: Introduction to Algorithms (Spring 2020)
- CS 21: Complexity Theory (Winter 2020)
- Ma 0: Transition to Mathematical Proofs (Summer 2020)