6 citations · 8 across the 10 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Finding Colorings in One-Sided Expanders
Rares-Darius Buhai, Yiding Hua, David Steurer +1
We establish new algorithmic guarantees with matching hardness results for coloring and independent set problems in one-sided expanders and related classes of graphs. For example,…
cs.CC2025
The Quasi-Polynomial Low-Degree Conjecture is False
Rares-Darius Buhai, Jun-Ting Hsieh, Aayush Jain +1
There is a growing body of work on proving hardness results for average-case estimation problems by bounding the low-degree advantage (LDA) - a quantitative estimate of the closene…
math.ST2025
Lasso and Partially-Rotated Designs
Rares-Darius Buhai
We consider the sparse linear regression model , where is the design, is a -sparse secret, and…