In recent years, a new “fine-grained” theory of computational hardness has been developed,
based on “fine-grained reductions” that focus on exact running times for problems …

Two important similarity measures between sequences are the longest common
subsequence (LCS) and the dynamic time war** distance (DTWD). The computations of …

Algorithmic research strives to develop fast algorithms for fundamental problems. Despite its
many successes, however, many problems still do not have very efficient algorithms. For …

The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds
on dynamic data structures and graph problems. This line of work was initiated by Pâtraşcu …

Our work explores the hardness of 3SUM instances without certain additive structures, and
its applications. As our main technical result, we show that solving 3SUM on a size-n integer …

We present a collection of new results on problems related to 3SUM, including: The first truly
subquadratic algorithm for computing the (min,+) convolution for monotone increasing …

Due to the lack of unconditional polynomial lower bounds, it is now in fashion to prove
conditional lower bounds in order to advance our understanding of the class P. The vast …

Subset Sumand k-SAT are two of the most extensively studied problems in computer
science, and conjectures about their hardness are among the cornerstones of fine-grained …

In this paper, we show that the time complexity of monotone min-plus product of two n× n
matrices is Õ (n (3+ ω)/2)= Õ (n 2.687), where ω< 2.373 is the fast matrix multiplication …

The edit distance between two rooted ordered trees with n nodes labeled from an alphabet
Ʃ is the minimum cost of transforming one tree into the other by a sequence of elementary …