2 citations · 4 across the 10 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.CC2024★ 1 cited
Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
Kiril Bangachev, Guy Bresler, Stefan Tiegel +1
We present a polynomial-time reduction from solving noisy linear equations over in dimension with a un…
math.PR2024★ 1 cited
Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
Kiril Bangachev, Guy Bresler
The distribution is formed by sampling independent vectors uniformly on and placing an edge between pair…
math.ST2024
On The Fourier Coefficients of High-Dimensional Random Geometric Graphs
Kiril Bangachev, Guy Bresler
The random geometric graph is formed by sampling i.i.d. vectors uniformly on and placing an edge be…