Scholar
Vinayak M Kumar
Google Scholar ID: e1f6Y1oAAAAJ
Graduate Student, UT Austin
Citations & Impact
Citations
28
H-index
4
i10-index
1
Publications
8
Co-authors
0
Contact
Publications
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
- Publications and Preprints:
- - Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes
- - Most Juntas Saturate the Hardcore Lemma (SOSA 2026)
- - Linear Hashing Is Optimal (STOC 2025)
- - New Pseudorandom Generators and Correlation Bounds Using Extractors (ITCS 2025)
- - Improved Circuit Lower Bounds and Quantum-Classical Separations (Preprint)
- - Relaxed Local Correctability from Local Testing (STOC 2024, Danny Lewin Best Student Paper Award)
- - Tight Correlation Bounds for Circuits Between AC0 and TC0 (CCC 2023)
- - On the Rational Degree of Boolean Functions and Applications (Preprint)
- - Pseudobinomiality of the Sticky Random Walk (ITCS 2021)
- - Condition Number Bounds for Causal Inference (UAI 2021)
Research Experience
- Served as a TA for the following courses:
- - UT Austin: CS 395T: Spectral Graph Theory (Spring 2025), CS 395T: Pseudorandomness (Fall 2023), CS 388C: Combinatorics and Graph Theory (Spring 2023)
- - Caltech: CS 151: Graduate Complexity Theory (Spring 2021), CS 139: Graduate Algorithms (Winter 2021), CS 38: Introduction to Algorithms (Spring 2020), CS 21: Introduction to Complexity Theory (Winter 2020), Ma 0: Transition to Mathematical Proofs (Summer 2020)
Education
- Joined UT Austin's Computer Science Theory group in 2021 for a Ph.D. Received B.S. in mathematics and computer science at Caltech. Mentored by Venkatesan Guruswami and Leonard Schulman during undergraduate years.
Background
- Research Interests: Combinatorial and probabilistic problems in pseudorandomness and complexity theory, such as hashing, coding theory, and circuit complexity. Advisor: David Zuckerman. Supported by a Jane Street Fellowship.
Miscellany
- Personal interests not provided
Co-authors