Synthesis planning and reaction outcome prediction are two fundamental problems in
computer-aided organic chemistry for which a variety of data-driven approaches have …

We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

Fast matrix multiplication is one of the most fundamental problems in algorithm research.
The exponent of the optimal time complexity of matrix multiplication is usually denoted by ω …

A comprehensive update of the leading algorithms text, with new material on matchings in
bipartite graphs, online algorithms, machine learning, and other topics. Some books on …

We present a new randomized method for computing the min-plus product (aka, tropical
product) of two n× n matrices, yielding a faster algorithm for solving the all-pairs shortest …

Before there were computers, there were algorithms. But now that there are computers, there
are even more algorithms, and algorithms lie at the heart of computing. This book provides a …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

The diameter and the radius of a graph are fundamental topological parameters that have
many important practical applications in real world networks. The fastest combinatorial …

Several research teams have recently been working toward the development of practical
general-purpose protocols for verifiable computation. These protocols enable a …

We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for
weighted directed graphs. Both algorithms use fast matrix multiplication algorithms. The first …