We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention
of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can …

Popular fine-grained hypotheses have been successful in proving conditional lower bounds
for many dynamic problems. Two of the most widely applicable hypotheses in this context …

Detecting if a graph contains ak-Clique is one of the most fundamental problems in
computer science. The asymptotically fastest algorithm runs in time O (n ω k/3), where ω is …

Keyword search, which finds the documents containing all the keywords supplied by a user,
has proved to be an effective approach for querying non-structured information that does not …

We consider a range-search variant of the closest-pair problem. Let $\varGamma $ be a
fixed shape in the plane. We are interested in storing a given set of $ n $ points in the plane …

Spatial data processing had been a dominant contributor in a wide assortment of
applications including health care, urban planning and infrastructure designing. As the …

Let S be a set of n weighted points in the plane and let R be a query range in the plane. In
the range closest pair problem, we want to report the closest pair in the set R∩ S. In the …