Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Vinayak M. Kumar
Observed name:
Kumar, Vinayak M.
Institutions:
The University of Texas at Austin,
University of California, Berkeley
Observed institutions:
California Institute of Technology,
University of Waterloo,
The University of Texas at Austin,
University of California, Berkeley
ORCID:
0009-0002-7309-5648
Observed ORCID:
0009-0002-7309-5648
OpenAlex ID:
A5057163359
Relaxed Local Correctability from Local Testing
2024
·
Vinayak M. Kumar
, Geoffrey Mon
·
ACM Symposium on Theory of Computing (STOC)
·
13
Linear Hashing Is Optimal
2025
·
Michael Jaber
, Vinayak M. Kumar
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
12
PDF
Improved Circuit Lower Bounds and Quantum-Classical Separations
2024
·
Grewal, Sabee
, Kumar, Vinayak M.
·
arXiv (Cornell University)
·
7
PDF
List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$
2026
·
Kumar, Vinayak M.
, Mon, Geoffrey
·
arXiv (Cornell University)
·
6
PDF
Pseudobinomiality of the Sticky Random Walk
2021
·
Guruswami, Venkatesan
, Kumar, Vinayak M.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
6
PDF
On the Rational Degree of Boolean Functions and Applications
2023
·
Iyer, Vishnu
, Jain, Siddhartha
, et al.
·
arXiv (Cornell University)
·
5
PDF
Condition Number Bounds for Causal Inference
2021
·
Spencer Gordon
, Vinayak M. Kumar
, et al.
·
Uncertainty in Artificial Intelligence
·
5
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes
2026
·
Elena Grigorescu
, Vinayak M. Kumar
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
3
Relaxed Local Correctability from Local Testing
2025
·
Vinayak M. Kumar
, Geoffrey Mon
·
SIAM Journal on Computing
·
2
Most Juntas Saturate the Hardcore Lemma
2026
·
Vinayak M. Kumar
·
Society for Industrial and Applied Mathematics eBooks
·
1
PDF
A Universal Threshold Theory for Local Properties of Random Linear Codes
2026
·
Kumar, Vinayak M.
, Li, Ray
, et al.
·
arXiv (Cornell University)
PDF
Linear Hashing Is Poissonesque
2026
·
Kumar, Vinayak M.
·
arXiv (Cornell University)
PDF
Covering $\mathbb{F}_2^n$ with Hamming Balls
2026
·
Jaber, Michael
, Kumar, Vinayak M.
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
15
Citation count:
67
H-index:
5
I10-index:
2
Year
Topic
Type