We study the spectral implications of re-weighting a graph by the
ℓ_∞-Le...
A geometric graph associated with a set of points P= {x_1, x_2, ⋯, x_n
}...
We study the problem of interpolating a noisy Fourier-sparse signal in t...
A recent work of Larsen [Lar23] gave a faster combinatorial alternative ...
The success of deep learning comes at a tremendous computational and ene...
In the Distance Oracle problem, the goal is to preprocess n vectors x_1,...
We revisit the classical problem of band-limited signal reconstruction –...
The Fast Gaussian Transform (FGT) enables subquadratic-time multiplicati...
We present a faster interior-point method for optimizing sum-of-squares ...
A common challenge in large-scale supervised learning, is how to exploit...
The slow convergence rate and pathological curvature issues of first-ord...
Motivated by recent Linear Programming solvers, we design dynamic data
s...
In FOCS 1986, Wilber proposed two combinatorial lower bounds on the
oper...
In 2010, Pǎtraşcu proposed the following three-phase dynamic problem,
as...
Motivated by storage applications, we study the following data structure...
We prove an Ω(d n/ ( n)^2) lower bound on the dynamic
cell-probe comple...
We show that static data structure lower bounds in the group (linear) mo...
The Burrows-Wheeler Transform (BWT) is among the most influential discov...
A fundamental question that shrouds the emergence of massively parallel
...