3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
The first polynomial improvements over the textbook algorithms for 3-SUM and All-Pairs Shortest Paths are given, and the Exact Triangle hypothesis is refuted, and the All-Edges Sparse Triangle problem is solved in truly subquadratic time on sparse lopsided tripartite graphs.
The current best bounds on the matrix multiplication exponent $\omega$ are obtained through a refinement of the laser method called combination loss analysis (Duan et al., 2022; Williams et al., 2024; Alman et al., 2025). In this note, we address the optimization problem at the core of this approach and propose several...
We show that set cover on a universe of size $n$ and with sets of size at most $k$ can be solved in time $2^{(1-1/k+O(1/k^{3/2}))n}$. This improves on a $2^{(1-0.929/k)n}$-time algorithm of Bj\"orklund (STACS 2010) for all sufficiently large $k$.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
