Vinayak M. Kumar

According to our database, Vinayak M. Kumar authored at least 10 papers between 2021 and 2025.

Collaborative distances:

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

2025

Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes.

Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon

CoRR, November, 2025

Most Juntas Saturate the Hardcore Lemma.

Vinayak M. Kumar

CoRR, October, 2025

Linear Hashing Is Optimal.

Michael Jaber, Vinayak M. Kumar, David Zuckerman

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

New Pseudorandom Generators and Correlation Bounds Using Extractors.

Vinayak M. Kumar

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

Improved Circuit Lower Bounds With Applications to Exponential Separations Between Quantum and Classical Circuits.

Sabee Grewal, Vinayak M. Kumar

Electron. Colloquium Comput. Complex., 2024

Relaxed Local Correctability from Local Testing.

Vinayak M. Kumar, Geoffrey Mon

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

On the Rational Degree of Boolean Functions and Applications.

Vishnu Iyer, Siddhartha Jain, Matt Kovacs-Deak, Vinayak M. Kumar, Luke Schaeffer, Daochen Wang, Michael Whitmeyer

Electron. Colloquium Comput. Complex., 2023

Tight Correlation Bounds for Circuits Between AC0 and TC0.

Vinayak M. Kumar

Proceedings of the 38th Computational Complexity Conference, 2023

2021

Condition number bounds for causal inference.

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

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Pseudobinomiality of the Sticky Random Walk.

Venkatesan Guruswami, Vinayak M. Kumar

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021