Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given
an nxn matrix M and will receive n column-vectors of size n, denoted by v1,..., vn, one by …

We consider several well-studied problems in dynamic algorithms and prove that sufficient
progress on any of them would imply a breakthrough on one of five major open problems in …

Post COVID-19 vaccine development, nations are now getting ready to face another
challenge: how to effectively distribute vaccines amongst the masses to quickly achieve herd …

We give the first almost-linear time algorithms for several problems in incremental graphs
including cycle detection, strongly connected component maintenance, st shortest path …

In the decremental single-source shortest paths problem, the goal is to maintain distances
from a fixed source s to every vertex v in an m-edge graph undergoing edge deletions. In …

Let G=(V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge
deletions. In the decremental single-source reachability problem (SSR), we are given a fixed …

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 …

The incremental problem for a class Q of graph queries aims to compute, given a query Q
in'Q, graph G, output Q (G) and updates Δ G to G as input, changes Δ O to Q (G) such that Q …

We develop a sampling-based motion planning algorithm that combines long-term temporal
logic goals with short-term reactive requirements. The mission specification has two parts:(1) …

In this paper, we propose a sampling-based motion planning algorithm that finds an infinite
path satisfying a Linear Temporal Logic (LTL) formula over a set of properties satisfied by …